Magically efficient backtracking, and how to revolutionise Game Theory

Paulo Oliva

The talk presents two related applications of computing with higher-order functions. The first is a novel way of carrying out efficient backtracking by making use of higher-order functions and Haskell’s lazy evaluation. We use so-called selection functions. We will also show how these selection functions can faithfully model players in strategic games, giving rise to a much more modular approach to Game Theory.