The tutorial paper: What Sequential Games, the Tychonoff Theorem and the Double-Negation Shift have in Common. We would have liked to include more material and more remarks of an expository nature, and more references to other people's related work, but we had a hard limit of 12 pages.

Agda programs/proofs. Set your browser to use UTF-8 encoding to be able to properly see the mathematical symbols.

A Haskell program showing that non-empty exhaustible sets are searchable. (This was mentioned in the paper but omitted for lack of space.)