A naïve implementation of Conways' Game of Life in Haskell.

Counting the number of live neighbours for a given cell is inefficient, but otherwise it runs fine.