]. H. Bar84 and . Barendregt, The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics, 1984.

]. H. Bar91 and . Barendregt, Introduction to generalized type systems, J. Funct. Programming, vol.1, issue.2, pp.125-154, 1991.

]. H. Bar92 and . Barendregt, Lambda calculi with types, Log. Comput. Sci, vol.2, issue.2, pp.117-309, 1992.

S. [. Barbanera, . [. Berardi, H. Barendregt, and . Geuvers, A Symmetric Lambda Calculus for Classical Program Extraction, Handbook of Automated Reasoning, pp.103-117, 1996.
DOI : 10.1006/inco.1996.0025

G. Barthe, J. Hatcliff, and M. H. Sørensen, A notion of classical pure type system, Proc. of the 13th Annual Conf. on Math. Foundations of Programming Semantics, MFPS'97, pp.4-59, 1997.

M. [. Coppo and . Dezani-ciancaglini, A new type assignment for lambda-terms. Archive f. math. Logic u. Grundlagenforschung, pp.139-156, 1978.

[. Curien and H. Herbelin, The duality of computation, Proc. of the 5 th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP'00), pp.233-243, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377

S. [. Dougherty, P. Ghilezan, S. Lescanne, and . Likavec, Strong Normalization of the Dual Classical Sequent Calculus, Proc. of the 12th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05), pp.169-183, 2005.
DOI : 10.1007/11591191_13

]. R. Dn05a, K. David, and . Nour, Arithmetical proofs of strong normalization results for the symmetric ?µ, Proc. of the 9th Int. Conf. on Typed Lambda Calculus and Applications (TLCA'05), pp.162-178, 2005.

]. R. Dn05b, K. David, and . Nour, Why the usual candidates of reducibility do not work for the symmetric ?µ-calculus, Post-proc. of the 2nd Work. on Computational Logic and Applications, pp.101-111, 2005.

]. D. Dou06, ]. Doughertygir72, and . Girard, Personal communication Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur, Thèse d'état, 1972.

]. Gir87, A. Lengrand, and . Miquel, Linear logic A classical version of F ?, 1st Work. on Classical logic and Computation, pp.1-101, 1987.

. [. Martin-löf, Intuitionistic Type Theory. Number 1 in Studies in Proof Theory, Lecture Notes. Bibliopolis, 1984.

J. [. Melliès and . Vouillon, Recursive Polymorphic Types and Parametricity in an Operational Framework, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.82-91, 2005.
DOI : 10.1109/LICS.2005.42

]. M. Par92 and . Parigot, ?µ-calculus: An algorithmique interpretation of classical natural deduction, Proc. of the Int. Conf. on Logic Programming and Automated Reasoning (LPAR'92), pp.190-201, 1992.

]. E. Pol04 and . Polonovski, Strong normalization of lambda-mu-mu/tilde-calculus with explicit substitutions, Proc. of the 7th Int. Conf. on Foundations of Software Science and Computation Structures, pp.423-437

]. P. Sel01 and . Selinger, Control categories and duality: on the categorical semantics of the ?µ-calculus, Math. Structures in Comput. Sci, vol.11, issue.2, pp.207-260, 2001.

]. C. Ste00 and . Stewart, On the formulae-as-types correspondence for classical logic, 2000.

]. C. Urb00 and . Urban, Classical Logic and Computation, 2000.

]. P. Wad03 and . Wadler, Call-by-value is dual to call-by-name, Proc. of the 8th ACM SIGPLAN Int. Conf. on Functional programming (ICFP'03), pp.189-201, 2003.