1. Andrej Bauer & Matija Pretnar (2012): Programming with algebraic effects and handlers. Available at
  2. Martin Davis, George Logemann & Donald Loveland (1960): A machine program for theorem proving. Communications of the ACM 5(7), pp. 394–397, doi:10.1145/368273.368557.
  3. Martin Escardó (2007): Seemingly impossible functional programs. Available at
  4. Martin Escardó (2008): Exhaustible sets in higher-type computation. Logical methods in computer science 4(3:3), pp. 1–37, doi:10.2168/lmcs-4(3:3)2008.
  5. Martin Escardó (2008): A Haskell monad for infinite search in finite time. Available at
  6. Martin Escardó & Paulo Oliva (2010): Selection functions, bar recursion and backward induction. Mathematical structures in computer science 20(2), pp. 127–168, doi:10.1017/S0960129509990351.
  7. Martin Escardó & Paulo Oliva (2010): What sequential games, the Tychonoff theorem and the double-negation shift have in common. Proc. of 3rd ACM SIGPLAN Wksh. on Mathematically Structured Functional Programming, doi:10.1145/1863597.1863605.
  8. Martin Escardó & Paulo Oliva (2011): Sequential games and optimal strategies. Proc R Soc A 467, pp. 1519–1545, doi:10.1098/rspa.2010.0471.
  9. Martin Escardó & Paulo Oliva (2012): Computing Nash equilibria of unbounded games. Proceedings of the Turing centenary conference.
  10. Jules Hedges (2013): A generalisation of Nash's theorem with higher-order functionals. Proc R Soc A 469(2154), doi:10.1098/rspa.2013.0041.
  11. Joao Marques-Silva, Ines Lynce & Sharad Malik (2008): Conflict-driven clause learning SAT solvers. In: Armin Biere, Marijn Heule, Hans van Maaren & Toby Walsch: Handbook of satisfiability, chapter 4. IOS Press.

Comments and questions to:
For website issues: