I’ll kick this off. My name is Jaro. I have been interested in Haskell for about 8 years now. I like it because of it’s connections to theory; there is always more to learn!

I’m currently working on gigaparsec which is a parser combinator library like parsec and megaparsec, but gigaparsec allows you to write your parser in a natural left-recursive way and it returns all possible parses instead of just the first parse that succeeds. My goal is to make a parser combinator library that allows you to use annotations to inform the parsing process instead of forcing you to restructure your parser.

Recently, I’m getting more and more convinced that correctness is the cornerstone of computation. To write a useful program you should first specify the idea itself and only later provide an efficient implementation. I got this idea from Conal Elliot who has talked about it on the Type Theory Forall podcast and recently at ZuriHac (recording will be released later).

So, now I’ve also started reading the HoTT book to see what it really takes to express myself formally.

Looking forward to your introductions!