fold is a really useful operator in a number of programming languages, including Haskell. It also hs a dual partner, unfold. But more importantly, both can be generalised, using a little category theory, to F-algebras and F-coalgebras. Amazingly, unfold, in the right category (as I discovered after a weekend of frenzied category theory) gives a really nice way to convert descriptions of automata into runnable automata. Anyway, I wrote the whole thing up as a piece of literate Haskell.
UPDATE: That came out formatted ugly so I've moved it to my web site where I'll eventually format it better. Here's the link.
- ► 2011 (13)
- ► 2010 (20)
- ► 2009 (21)
- ► 2008 (35)
- ► 2007 (37)
- Quantum Probability
- A Neat Proof Technique
- The General Theory of Self-Reproducing Programs
- Stanislaw Lem has Passed Away
- The Most Amazing and Mysterious Thing in All of Ma...
- Sets, Classes and Voodoo
- The Representation of Integers by Quadratic Forms
- Category Theory Screws You Up!
- What can I do with adjoints? And Lemma 28.
- Answers and questions
- Homotopies between proofs and between programs
- Cellular automaton puzzle
- Coalgebras and Automata
- It's a square, square world!
- Blind Games
- When is one thing equal to some other thing?
- An Actual Application of Fractal Dimension
- A Cautionary Tale for Would-Be Generalisers
- ▼ March (20)