배현진 징계 효력 중지…“장동혁 지금이라도 반성하라”
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.。关于这个话题，旺商聊官方下载提供了深入分析
Because I was young then, right?，推荐阅读51吃瓜获取更多信息
I'd argue the real answer is slightly more nuanced - and …