Regex is slower than parsing in every language? Haskell's design just lends itself to providing a really nice dx/solution for them

The performance of compiled Regex is roughly the same as parsing for tasks of the same complexity. For complex tasks compiled Regex are often faster as the compiler is more likely to write optimized structures than developers. Yes you can write faster solutions by hand, however most people don't.

yep, people don't, and probably shouldn't d2d iin most languages, which swings back to the developer experience and semantics of monadic parser combinator libs discussed in the blog post - In a lot of languages it's almost always easier to regex your way out of something (especially since in a lot of normal world use cases in web world especially are pretty mediocre check-if-this-is-an-email type use cases), but hs & it's libs make building and combining parsers so easy that it almost makes one of the most common denominators of other language obsolete, which I think is pretty cool

Yep, build in infra for parsing is awesome. Do note that I actually don't think Regex is the right tool for many jobs. As an example here¹ is the best Regex I could find for valid RFC5322 email validation - even it does not correctly parse all valid emails.  ¹ https://elliotchance.medium.com/its-impossible-to-validate-an-email-address-ae606ad711b4

wow good share