<bibliography>
 <citation type="inproceedings" key="escardo98">
  <author>Martin <surname>Escard&#243;</surname></author>
  <year>1998</year>
  <title>Effective and sequential definition by cases on the reals via infinite signed-digit numerals</title>
  <booktitle>Proceedings of the 3rd workshop on Computation and Approximation</booktitle>
  <series>ENTCS</series>
  <volume>13</volume>
  <doi>10.1016/S1571-0661(05)80214-2</doi>
 </citation>
 <citation type="article" key="escardo04">
  <author>Martin <surname>Escard&#243;</surname></author>
  <year>2004</year>
  <title>Synthetic topology of data types and classical spaces</title>
  <journal>ENTCS</journal>
  <volume>87</volume>
  <pages>21&#8211;156</pages>
  <doi>10.1016/j.entcs.2004.09.017</doi>
 </citation>
 <citation type="" key="escardo07">
  <author>Martin <surname>Escard&#243;</surname></author>
  <year>2007</year>
  <title>Seemingly impossible functional programs</title>
  <url>http://math.andrej.com/2007/09/28/seemingly-impossible-functional-programs/</url>
 </citation>
 <citation type="article" key="escardo08">
  <author>Martin <surname>Escard&#243;</surname></author>
  <year>2008</year>
  <title>Exhaustible sets in higher-type computation</title>
  <journal>Logical methods in computer science</journal>
  <volume>4</volume>
  <number>3:3</number>
  <pages>1&#8211;37</pages>
  <doi>10.2168/lmcs-4(3:3)2008</doi>
 </citation>
 <citation type="article" key="escardo10a">
  <author>Martin <surname>Escard&#243;</surname></author>
  <author>Paulo <surname>Oliva</surname></author>
  <year>2010</year>
  <title>Selection functions, bar recursion and backward induction</title>
  <journal>Mathematical structures in computer science</journal>
  <volume>20</volume>
  <number>2</number>
  <pages>127&#8211;168</pages>
  <doi>10.1017/S0960129509990351</doi>
 </citation>
 <citation type="inproceedings" key="escardo10d">
  <author>Martin <surname>Escard&#243;</surname></author>
  <author>Paulo <surname>Oliva</surname></author>
  <year>2010</year>
  <title>What sequential games, the Tychonoff theorem and the double-negation shift have in common</title>
  <booktitle>Proceedings of MSFP'10</booktitle>
  <doi>10.1145/1863597.1863605</doi>
 </citation>
 <citation type="article" key="escardo11">
  <author>Martin <surname>Escard&#243;</surname></author>
  <author>Paulo <surname>Oliva</surname></author>
  <year>2011</year>
  <title>Sequential games and optimal strategies</title>
  <journal>Proceedings of the Royal Society A</journal>
  <volume>467</volume>
  <pages>1519&#8211;1545</pages>
  <doi>10.1098/rspa.2010.0471</doi>
 </citation>
 <citation type="article" key="escardo12">
  <author>Martin <surname>Escard&#243;</surname></author>
  <author>Paulo <surname>Oliva</surname></author>
  <year>2012</year>
  <title>Computing Nash equilibria of unbounded games</title>
  <journal>Proceedings of the Turing centenary conference</journal>
  <url>http://www.easychair.org/publications/paper/106503</url>
 </citation>
 <citation type="article" key="escardo15b">
  <author>Martin <surname>Escard&#243;</surname></author>
  <author>Paulo <surname>Oliva</surname></author>
  <year>2017</year>
  <title>The Herbrand functional interpretation of the double negation shift</title>
  <journal>Journal of symbolic logic</journal>
  <volume>82</volume>
  <number>2</number>
  <pages>590&#8211;607</pages>
  <doi>10.1017/jsl.2017.8</doi>
 </citation>
 <citation type="inproceedings" key="hedges14">
  <author>Jules <surname>Hedges</surname></author>
  <year>2014</year>
  <title>Monad transformers for backtracking search</title>
  <booktitle>Proceedings of MSFP'14</booktitle>
  <series>EPTCS</series>
  <pages>31&#8211;50</pages>
  <doi>10.4204/EPTCS.153.3</doi>
 </citation>
 <citation type="unpublished" key="hedges15a">
  <author>Jules <surname>Hedges</surname></author>
  <year>2015</year>
  <title>The selection monad as a CPS translation</title>
  <note>ArXiv:1503.06061</note>
 </citation>
 <citation type="phdthesis" key="hedges_towards_compositional_game_theory">
  <author>Jules <surname>Hedges</surname></author>
  <year>2016</year>
  <title>Towards compositional game theory</title>
  <school>Queen Mary University of London</school>
 </citation>
 <citation type="inproceedings" key="hedges_etal_selection_equilibria_higher_order_games">
  <author>Jules <surname>Hedges</surname></author>
  <author>Paulo <surname>Oliva</surname></author>
  <author>Evguenia <surname>Shprits</surname></author>
  <author>Viktor <surname>Winschel</surname></author>
  <author>Philipp <surname>Zahn</surname></author>
  <year>2017</year>
  <title>Selection equilibria of higher-order games</title>
  <booktitle>Practical aspects of declaritive languages</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>10137</volume>
  <publisher>Springer</publisher>
  <pages>136&#8211;151</pages>
  <doi>10.1007/978-3-319-51676-9_9</doi>
 </citation>
 <citation type="article" key="lescanne12">
  <author>Pierre <surname>Lescanne</surname></author>
  <author>Matthieu <surname>Perrinel</surname></author>
  <year>2012</year>
  <title>``Backward'' coinduction, Nash equilibrium and the rationality of escalation</title>
  <journal>Acta Informatica</journal>
  <volume>49</volume>
  <number>3</number>
  <pages>117&#8211;137</pages>
  <doi>10.1007/s00236-012-0153-3</doi>
 </citation>
 <citation type="book" key="brown08">
  <author>Kevin <surname>Leyton-Brown</surname></author>
  <author>Yoav <surname>Shoham</surname></author>
  <year>2008</year>
  <title>Essentials of game theory: a concice, multidisciplinary introduction</title>
  <publisher>Morgan and Claypool</publisher>
 </citation>
 <citation type="book" key="mailath_samuelson_repeated_games_reputations">
  <author>George <surname>Mailath</surname></author>
  <author>Larry <surname>Samuelson</surname></author>
  <year>2006</year>
  <title>Repeated games and reputations</title>
  <publisher>Oxford University Press</publisher>
  <doi>10.1093/acprof:oso/9780195300796.001.0001</doi>
 </citation>
 <citation type="book" key="mas_collel_etal_microeconomic_theory">
  <author>Andreu <surname>Mas-Colell</surname></author>
  <author>Michael <surname>Whinston</surname></author>
  <author>Jerry <surname>Green</surname></author>
  <year>1995</year>
  <title>Microeconomic theory</title>
  <publisher>Oxford University Press</publisher>
 </citation>
 <citation type="article" key="moggi91">
  <author>Eugenio <surname>Moggi</surname></author>
  <year>1991</year>
  <title>Notions of computation and monads</title>
  <journal>Information and Computation</journal>
  <volume>93</volume>
  <pages>55&#8211;92</pages>
  <doi>10.1016/0890-5401(91)90052-4</doi>
 </citation>
 <citation type="article" key="nash50b">
  <author>John <surname>Nash</surname></author>
  <year>1950</year>
  <title>Equilibrium points in n-person games</title>
  <journal>Proceedings of the National Academy of Sciences</journal>
  <volume>36</volume>
  <number>1</number>
  <pages>48&#8211;49</pages>
  <doi>10.1073/pnas.36.1.48</doi>
 </citation>
 <citation type="book" key="vonneumann44">
  <author>John <surname>von Neumann</surname></author>
  <author>Oskar <surname>Morgenstern</surname></author>
  <year>1944</year>
  <title>Theory of games and economic behaviour</title>
  <publisher>Princeton University Press</publisher>
 </citation>
 <citation type="article" key="schwalbe01">
  <author>Ulrich <surname>Schwalbe</surname></author>
  <author>Paul <surname>Walker</surname></author>
  <year>2001</year>
  <title>Zermelo and the early history of game theory</title>
  <journal>Games and economic behaviour</journal>
  <volume>34</volume>
  <pages>123&#8211;137</pages>
  <doi>10.1006/game.2000.0794</doi>
 </citation>
 <citation type="techreport" key="weihrauch-simple-introduction-computable-analysis">
  <author>Klaus <surname>Weihrauch</surname></author>
  <year>1995</year>
  <title>A simple introduction to computable analysis</title>
  <type>Technical Report</type>
  <institution>Fern Universit&#228;t</institution>
 </citation>
</bibliography>
