A stack-based parser that does just enough

Revelations of the Ix datatype

Brute force trumps cleverness

Gradient descent and higher-order functions

It's all about the data structures

Generalising makes things simpler

Overthinking bingo

Studiously not using a Bits datatype.

Parsers and folds

A warm-up, apart from Cabal

A look back on the event

Avoiding the very deep weeds of number theory

More cellular automata, but with added typeclass fun

Starting simple, then changing direction for performance

A simple game, with a DIY hash table for speed

Confusing in its simplicity

Yak shaving and sea monsters

More parsing. It started easier than I thought, then Haskell made it harder.

Going back to the source for parser combinators

Cellular automata and typeclasses

Types and parsers, then using a library for the hard bit.

Diving into ST and monad loop control, all in the pursuit of speed