Random notes:
Turing-Completeness of Polymorphic Stream Equation Systems (talk, based on joint work with Florent Balestrieri)
Isomorphism of Finitary Inductive Types (talk)
Turing-Completeness of Polymorphic Stream Equation Systems (postprint, with Florent Balestrieri)
How To Create a Doubly-Linked Dodecahedron
On the Merits of the Eta-Law for Inductive Types
School of Computer Science and Information Technology Home Page
The University of Nottingham Home Page