A Wild Presentation Appears!
A few hours ago I was asked if I could fill in for a speaker who couldn't make it to an event. I said yes, then pondered what I would actually talk about for a bit. Some topics I considered:
- Tasks / Futures: like promises but better (lazy, cancellable, lawful functors/monads, etc.)
- Sum types: expressive and safe domain modeling
- Folktale, Sanctuary: FP-in-JS helper libraries (include tasks & sum types)
- Recursion schemes: what array methods are to for loops, recursion schemes are to manual recursion
Parsers, I Choose You!
In the end I decided that I would go for monadic parser combinators in the interest of time. That's because:
- I like them
- They embody a lot of nice FP characteristics (purity, composition, monads)
- I just finished Part 1 of an interactive tutorial / article on them
- They are relatively easy to demo live without prep
The Repo
This repo contains:
- The parser library class implementation
- Example programs using the parser library
- Sample grammars to work off of
- The presentation slide deck
Addendum
Thanks all for listening! You can find an extended math example here.