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

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF. Information and Computation, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930
URL : https://doi.org/10.1006/inco.2000.2930

R. Amadio and P. Curien, Domains and Lambda-Calculi, volume 46 of Cambridge Tracts in Theoretical Computer Science, 1998.

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, W. Buchholz, and H. Schwichtenberg, Refined program extraction from classical proofs, Annals of Pure and Applied Logic, vol.114, issue.1-3, pp.3-25, 2002.
DOI : 10.1016/S0168-0072(01)00073-2
URL : https://doi.org/10.1016/s0168-0072(01)00073-2

U. Berger and P. Oliva, Modified bar recursion and classical dependent choice, Logic Colloquium Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, pp.89-107, 2001.
DOI : 10.1017/9781316755860.004

V. Blot and C. Riba, On Bar Recursion and Choice in a Classical Setting, 11th Asian Symposium on Programming Languages and Systems, pp.349-364, 2013.
DOI : 10.1007/978-3-319-03542-0_25
URL : https://hal.archives-ouvertes.fr/hal-00835540

H. Friedman, Classically and intuitionistically provably recursive functions, Higher Set Theory, pp.21-27, 1978.
DOI : 10.1007/BFb0103100

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

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

H. Herbelin, On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic, 7th International Conference on Typed Lambda Calculi and Applications, pp.209-220, 2005.

M. Hofmann and T. Streicher, Completeness of Continuation Models for ?µ-Calculus. Information and Computation, pp.332-355, 2002.

M. Hyland and L. 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
URL : https://doi.org/10.1006/inco.2000.2917

C. Kleene, On the interpretation of intuitionistic number theory, The Journal of Symbolic Logic, vol.3, issue.04, pp.109-124, 1945.
DOI : 10.1007/BF01565439

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

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

B. Lafont, T. Reus, and . Streicher, Continuations Semantics or Expressing Implication by Negation, 1993.

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
URL : http://www.cogs.susx.ac.uk/users/jiml/lics97.ps.gz

J. Laird, Bistable Biorders: A Sequential Domain Theory, Logical Methods in Computer Science, vol.3, issue.2, 2007.
DOI : 10.2168/LMCS-3(2:5)2007
URL : https://lmcs.episciences.org/2222/pdf

A. Miquel, Existential witness extraction in classical realizability and via a negative translation, Logical Methods in Computer Science, vol.7, issue.2, 2011.
DOI : 10.1016/S0747-7171(89)80045-8
URL : https://hal.archives-ouvertes.fr/hal-00800560