A. Troelstra, Chapter VI Realizability. Studies in Logic and the Foundations of, Mathematics, vol.137, pp.407-473, 1998.

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

J. L. Krivine, Dependent choice, ???quote??? and the clock, Theoretical Computer Science, vol.308, issue.1-3, pp.1-3, 2003.
DOI : 10.1016/S0304-3975(02)00776-4
URL : https://hal.archives-ouvertes.fr/hal-00154478

J. L. Krivine, Realizability in classical logic, Panoramas et synthèses, vol.27, pp.197-229, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00154500

J. L. Krivine, Typed lambda-calculus in classical Zermelo-Fr??nkel set theory, Archive for Mathematical Logic, vol.40, issue.3, pp.189-205, 2001.
DOI : 10.1007/s001530000057

J. M. Hyland and C. H. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917

H. Nickau, Hereditarily sequential functionals, In: LFCS. Lecture Notes in Computer Science, pp.253-264, 1994.
DOI : 10.1007/3-540-58140-5_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2978

J. Laird, Full abstraction for functional languages with control, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.58-67, 1997.
DOI : 10.1109/LICS.1997.614931

S. Abramsky, K. Honda, and G. Mccusker, A fully abstract game semantics for general references, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), pp.334-344, 1998.
DOI : 10.1109/LICS.1998.705669

P. Clairambault, Least and Greatest Fixpoints in Game Semantics, FOSSACS. Lecture Notes in Computer Science, vol.5, issue.2, pp.16-31, 2009.
DOI : 10.2140/pjm.1955.5.285
URL : https://hal.archives-ouvertes.fr/hal-00443537

S. Abramsky and G. Mccusker, Call-by-value games, In: CSL. Lecture Notes in Computer Science, pp.1-17, 1997.
DOI : 10.1007/BFb0028004

R. Harmer, Games and full abstraction for non-deterministic languages, 1999.

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

P. A. Mellì-es, Sequential algorithms and strongly stable functions, Theor. Comput. Sci, vol.343, pp.1-2, 2005.

J. Laird, A semantic analysis of control, 1999.

T. Coquand, A semantics of evidence for classical arithmetic, The Journal of Symbolic Logic, vol.54, issue.01, pp.325-337, 1995.
DOI : 10.1007/BFb0079691

J. M. Hyland, Game semantics Semantics and logics of computation, 1997.

P. A. Mellì-es and N. Tabareau, Resource modalities in game semantics, In: LICS. IEEE, pp.389-398, 2007.

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