FT Edit: Access on iOS and web
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.
，这一点在PDF资料中也有详细论述
На шее Трампа заметили странное пятно во время выступления в Белом доме23:05
南方周末：你曾在美国有长达二十年的生活经历，接触过不少背景各异的伊朗人。对于伊朗与西方的联结，以及宗教底色对这个国家的深层影响，你有哪些切身的观察与感受？