Cellular Automata

As of March 2020, School of Haskell has been switched to read-only mode.

This is a short series in which I'm exploring ways some interesting structures in Haskell using cellular automata as motivating examples.

  • Part I: From Theory to Pretty Pictures 29 Nov 2014Edward Kmett

    This post shows how we can render automata on the web using a number of reusable components from the Haskell ecosystem.

  • Part II: PNGs and Moore 10 Jun 2015Edward Kmett

    In this part we'll explore how to make extensible folds for hashing, explore the connection between Gabriel Gonzales' `foldl` library and Moore machines, discover a Comonad, and concoct a way to generate custom PNGs by leveraging pieces of the existing Haskell ecosystem.

  • Part III: A World in a Bottle 16 Nov 2013Edward Kmett

    Now I'll show how we can prevent our automata from using extrinsic properties of their location and show how this lets us bend space.