S. Abramsky and G. Mccusker, Call-by-value games, Proceedings of CSL'97, pp.1-17, 1997.
DOI : 10.1007/BFb0028004

R. M. Amadio and P. Curien, Domains and Lambda-Calculi. Cambridge Tracts in Theoretical Computer Science, 1998.
DOI : 10.1017/cbo9780511983504
URL : https://hal.archives-ouvertes.fr/inria-00070008

S. Berardi, M. Bezem, and T. Coquand, Abstract, The Journal of Symbolic Logic, vol.39, issue.02, pp.600-622, 1998.
DOI : 10.1007/BF02007566

U. Berger and P. Oliva, Modified bar recursion and classical dependent choice, Lecture Notes in Logic, vol.20, pp.89-107, 2005.
DOI : 10.1017/9781316755860.004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9474

V. Blot, Realizability for Peano Arithmetic with Winning Conditions in HO Games, Proceedings of TLCA'13, 2013.

T. Griffin, A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.47-58, 1990.
DOI : 10.1145/96709.96714

R. Harmer, Games and Full Abstraction for Nondeterministic Languages, 1999.

J. M. Hyland and C. Ong, On Full Abstraction for PCF: I, II, and III. Information and Computation, pp.285-408, 2000.

U. Kohlenbach, Applied Proof Theory: Proof Interpretations and their Use in Mathematics, 2008.

J. Krivine, Realizability in classical logic In Interactive models of computation and program behaviour, of Panoramas et synthèses, pp.197-229

J. Laird, A Semantic analysis of control, 1998.

P. Oliva and T. Streicher, On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic, Fundam. Inform, vol.84, issue.2, pp.207-220, 2008.

M. Parigot, Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction, LPAR, pp.190-201, 1992.

P. Selinger, Control categories and duality: on the categorical semantics of the lambda-mu calculus, Mathematical Structures in Computer Science, vol.11, issue.2, pp.207-260, 2001.
DOI : 10.1017/S096012950000311X

S. G. Simpson, Subsystems of Second Order Arithmetic. Perspectives in Logic, 2010.

T. Streicher, A Classical Realizability Model araising from a Stable Model of Untyped Lambda-Calculus. Unpublished Notes, 2013.

T. Streicher and B. Reus, Classical logic, continuation semantics and abstract machines, Journal of Functional Programming, vol.8, issue.6, pp.543-572, 1998.
DOI : 10.1017/S0956796898003141

A. S. Troelstra, Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, LNM, vol.344, 1973.
DOI : 10.1007/BFb0066739