Static analysis of non-monadic parsers

Writeup and examples here. I think the profunctor one is pretty cool.


A couple of us are working on a semi-related project for biparsing. I think your thoughts on static analysis are very desirable features. We would appreciate your insight.

I started surveying Haskell packages for invertible syntax descriptions a while ago. Sadly I never finished. But y’all may be interested in what I have so far anyway: