finding all regex matches has always been O(n²). even in the engines built to prevent it

every regex engine that promises linear time breaks that promise the moment you ask for all matches. the problem has been there since the 70s, hiding in the iteration loop.

symbolic derivatives and the rust rewrite of RE#

RE#: how we built the world's fastest regex engine in F#

concretization, or how 10 lines of rust got me a dangling pointer and undefined behavior

gzip decompression in 250 lines of rust

why use F# for scripting and automation?

starting a dev/research blog