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

Z. Ariola, H. Herbelin, and A. Sabry, A proof-theoretic foundation of abortive continuations. Higher-Order and Symbolic Computation, pp.403-429, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00697242

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

G. Berry and P. Curien, Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982.
DOI : 10.1016/S0304-3975(82)80002-9
URL : https://doi.org/10.1016/s0304-3975(82)80002-9

V. Blot, Game semantics and realizability for classical logic, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01091628

U. Berger and P. Oliva, Modified bar recursion and classical dependent choice, Logic Colloquium '01, Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, pp.89-107, 2005.
DOI : 10.1017/9781316755860.004
URL : http://www.daimi.au.dk/~pbo/papers/ac011121.ps

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

P. Curien and H. Herbelin, The duality of computation, 5th International Conference on Functional Programming, pp.233-243, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377

P. De and G. , On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control, 5th International Conference on Logic Programming and Automated Reasoning, pp.31-43, 1994.

R. David and W. Py, Abstract, The Journal of Symbolic Logic, vol.121, issue.01, pp.407-413, 2001.
DOI : 10.2307/2694930

M. Hötzel, E. , and P. Oliva, The Peirce translation, Annals of Pure and Applied Logic, vol.163, issue.6, pp.681-692, 2012.

J. Girard, A new constructive logic: classic logic, Mathematical Structures in Computer Science, vol.7, issue.2, pp.255-296, 1991.
DOI : 10.1016/0304-3975(87)90045-4

J. Girard, On the unity of logic, Annals of Pure and Applied Logic, vol.59, issue.3, pp.201-217, 1993.
DOI : 10.1016/0168-0072(93)90093-S
URL : https://hal.archives-ouvertes.fr/inria-00075095

K. Gödel, Zur intuitionistischen Arithmetik und Zahlentheorie, Ergebnisse eines mathematischen Kolloquiums, pp.34-38, 1933.

K. Gödel, ??BER EINE BISHER NOCH NICHT BEN??TZTE ERWEITERUNG DES FINITEN STANDPUNKTES, Dialectica, vol.12, issue.3-4, pp.280-287, 1958.
DOI : 10.1111/j.1746-8361.1958.tb01464.x

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

H. Herbelin, Séquents qu'on calcule: de l'interprétation du calcul des séquents comme calcul de ?-termes et comme calcul de stratégies gagnantes, 1995.

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

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

H. Herbelin and A. Saurin, ?µ-calculus and ?µ-calculus: a Capital Difference, 2009.

. Stephen-cole-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

U. Kohlenbach, Theory of majorizable and continuous functionals and their use for the extraction of bounds from non-constructive proofs: effective moduli of uniqueness for best approximations from ineffective proofs of uniqueness, 1990.

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

G. Kreisel, Interpretation of analysis by means of constructive functionals of finite types, Constructivity in mathematics: Proceedings of the colloquium held at Amsterdam Studies in Logic and the Foundations of Mathematics, pp.101-128, 1957.

J. Krivine, A general storage theorem for integers in call-by-name ??-calculus, Theoretical Computer Science, vol.129, issue.1, pp.79-94, 1994.
DOI : 10.1016/0304-3975(94)90081-7

J. 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. 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

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, A semantic analysis of control, 1999.

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

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

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

L. Ong, A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract), 11th Annual IEEE Symposium on Logic in Computer Science, pp.230-241, 1996.

L. Ong and C. Stewart, A Curry-Howard foundation for functional computation with control, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.215-227, 1997.
DOI : 10.1145/263699.263722

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

M. Parigot, ????-Calculus: An algorithmic interpretation of classical natural deduction, 3rd International Conference on Logic Programming and Automated Reasoning, pp.190-201, 1992.
DOI : 10.1007/BFb0013061

G. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-255, 1977.
DOI : 10.1016/0304-3975(77)90044-5

T. Powell, On bar recursive interpretations of analysis, 2013.

T. Powell, The equivalence of bar recursion and open recursion, Annals of Pure and Applied Logic, vol.165, issue.11, pp.1727-1754, 2014.
DOI : 10.1016/j.apal.2014.07.003

A. Saurin, Separation with Streams in the ?µ-calculus, 20th IEEE Symposium on Logic in Computer Science, pp.356-365, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00527871

D. Scott, I. Type-theoretical-alternative-to, C. , and O. , A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoretical Computer Science, vol.121, issue.1-2, pp.411-440, 1993.
DOI : 10.1016/0304-3975(93)90095-B
URL : https://doi.org/10.1016/0304-3975(93)90095-b

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

C. Spector, Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, Recursive Function Theory: Proceedings of Symposia in Pure Mathematics, pp.1-27, 1962.
DOI : 10.1090/pspum/005/0154801

A. Sjerp, T. , and D. Van-dalen, Constructivism in mathematics: an introduction 123 of Studies in logic and the foundations of mathematics, 1988.