around a year ago, we built a regex engine in F# that not only outperformed the ones in dotnet, but went above and beyond competing with every other industrial regex engine on a large set of industry-standard benchmarks. additionally, it supports the full set of boolean operators (union, intersection, complement) and even a form of context-aware lookarounds, which no other engine has while preserving O(n) search-time complexity. the paper was published at POPL 2025, and i figured it’s time to open source the engine and share the story behind it. consider it a much more casual and chatty version of the paper, with more focus on engineering aspects that went into it.
全年龄段规划人群；核心需求是"财务安全+风险转移"
，推荐阅读WPS官方版本下载获取更多信息
I opened the article ranting about Beads’ 300K SLOC codebase, and “bloat” is maybe the biggest concern I have with pure vibecoding. From my limited experience, coding agents tend to take the path of least resistance to adding new features, and most of the time this results in duplicating code left and right.
«Они сами заварили эту кашу». Китай начал давить на Иран из-за конфликта с США. Что требует Пекин от партнера?19:31
，详情可参考PDF资料
Фото: Антон Великжанин / Коммерсантъ。业内人士推荐电影作为进阶阅读
Англия — Премьер-лига|29-й тур