  It has been shown that a functional interpretation of proofs in mathematical
analysis can be given by the product of selection functions, a mode of
recursion that has an intuitive reading in terms of the computation of optimal
strategies in sequential games. We argue that this result has genuine practical
value by interpreting some well-known theorems of mathematics and demonstrating
that the product gives these theorems a natural computational interpretation
that can be clearly understood in game theoretic terms.
