Mutable yet pure in the ST monad

For this meeting, we will go over how implement certain pure functions using algorithms that mutate data structures. This is possible using the ST monad. The ST monad ensures referential transparency using a cool trick with phantom parameters. We will have a look at the ST monad, its interface and library support. Then we will go through three examples of algorithms with mutation, comparing them to their persistent counterparts and benchmarking.

---
Our speaker, Ian Shipman is a Software Developer at Bitnomial, a Chicago-based futures & options exchange using Haskell for core services.