J. Girard, Une extension de l'interprétation de Gödeì a l'analyse, et son applicationàapplication`applicationà l'´ elimination des coupures dans l'analyse et la théorie des types, 2nd Scandinavian Logic Symposium, pp.63-69, 1971.

J. Reynolds, Towards a theory of type structure, ser. Lecture Notes in Computer Science, Programming Symposium, pp.408-423, 1974.

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

U. Berger and P. Oliva, Modified bar recursion and classical dependent choice, " in Logic Colloquium '01, ser, Lecture Notes in Logic, vol.20, pp.89-107, 2005.

J. Krivine, Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis, 25th EACSL Annual Conference on Computer Science Logic. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.251-2511, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01090769

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

J. C. Reynolds, Types, Abstraction and Parametric Polymorphism, IFIP Congress, pp.513-523, 1983.

P. Wadler, The Girard???Reynolds isomorphism (second edition), Theoretical Computer Science, vol.375, issue.1-3, pp.201-226, 2007.
DOI : 10.1016/j.tcs.2006.12.042

U. Berger, Program Extraction from Normalization Proofs, 1st International Conference on Typed Lambda Calculi and Applications, pp.91-106, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00150904

T. Altenkirch, M. Hofmann, and T. Streicher, Reduction-free normalisation for a polymorphic system, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.98-106, 1996.
DOI : 10.1109/LICS.1996.561309

A. Abel, Weak beta-eta-Normalization and Normalization by Evaluation for System F, 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, pp.497-511, 2008.
DOI : 10.1007/978-3-540-89439-1_35
URL : http://www.tcs.ifi.lmu.de/~abel/lpar08.pdf

J. Krivine, Lambda-calculus, types and models, ser. Ellis Horwood series in computers and their applications, 1993.

W. W. Tait, A realizability interpretation of the theory of species, Logic Colloquium, pp.240-251, 1975.
DOI : 10.1007/BFb0064875

J. Girard, Interprétation fonctionnelle etéliminationet´etélimination des coupures de l'arithmétique d'ordre supérieur, 1972.

R. Amadio and P. Curien, Domains and Lambda-Calculi, ser. Cambridge Tracts in Theoretical Computer Science, 1998.
DOI : 10.1017/cbo9780511983504

J. Diller and W. Nahm, Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen, Archiv für mathematische Logik und Grundlagenforschung, pp.49-66, 1974.
DOI : 10.1090/pspum/005/0154801