Resources for my POPL'2012 tutorial on the topology of seemingly impossible programs.

  1. The slides.

  2. Haskell code.

  3. Agda programs/proofs.

Martin Escardo
m.escardo@cs.bham.ac.uk
Last modified: Sat Jan 28 01:38:00 GMT 2012