Parsley is a parser combinator that foregoes monadic operations so that it can be processed at compile-time — with staging (via typed template haskell) — to produce very fast parsers. Instead it adopts selective operations.

In this talk, I will briefly describe what parser combinators are, describe the high-level design of the library, as well as outlining its current and future capabilities. I will discuss how staging works to optimise the parsers themselves.

Speaker: Jamie Willis