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.
Трамп высказался о непростом решении по Ирану09:14，详情可参考同城约会
It's 2025 and I am still making video games, which according to archive.org is 20 years since I started making games! That's a pretty long time to be doing one thing...，推荐阅读快连下载安装获取更多信息
Что думаешь? Оцени!
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.