I'll answer my own question; I've got a much better implementation, along
with an HOpenGL-based frontend, at
"http://ofb.net/~abe/hlife/hlife-0.1.tar.gz";. It uses a FiniteMap of 5x5
UArrays that are created and destroyed as needed; this gives it a good
balance of size (the grid is only bounded by
I'm implementing Conway's Life in Haskell; my basic implementation is
attached. Does anyone have suggestions for optimizations (or alternative
representations)? It's interesting to note that the difference between
this with no ghc optimization, -O, and -O2 is pretty striking;
