RE#: how we built the world's fastest regex engine in F#
Summary
RE# introduces a fast, general-purpose regex engine for F# that adds intersection and complement with linear-time guarantees. The post explains the design based on Brzozowski derivatives, minterm compression, and lazy DFA construction, plus how context-aware lookarounds are encoded in state, and it contrasts with backtracking and PCRE-style engines. It also highlights benchmarks, interoperability with .NET, and open-source availability.