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.
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.
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.
Martin Escardó & Paulo Oliva (2011):
Sequential games and optimal strategies.
Proc R Soc A 467,
pp. 1519–1545,
doi:10.1098/rspa.2010.0471.
Martin Escardó & Paulo Oliva (2012):
Computing Nash equilibria of unbounded games.
Proceedings of the Turing centenary conference.
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.
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.