H. P. Barendregt, The Lambda Calculus, Its Syntax and Semantics, 1985.

H. P. Barendregt, Lambda Calculi with types, Abramsky & al, pp.117-309, 1992.

H. P. Barendregt and W. , Dekkers and R. Statman Typed lambda calculus

U. Berger and H. Schwichtenberg, An inverse of the evaluation functional for typed lambda -calculus, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.203-211, 1991.
DOI : 10.1109/LICS.1991.151645

A. Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol.1, issue.02, 1940.
DOI : 10.2307/2371199

M. Coppo and M. Dezani, A new type assignment for lambda terms Archiv, Math. Logik, pp.139-156, 1978.

T. Coquand and G. Huet, The calculus of constructions, Information and Computation, vol.76, issue.2-3, pp.95-120, 1988.
DOI : 10.1016/0890-5401(88)90005-3
URL : https://hal.archives-ouvertes.fr/inria-00076024

R. David, Normalization without reducibility, Annals of Pure and Applied Logic, vol.107, issue.1-3, pp.121-130, 2001.
DOI : 10.1016/S0168-0072(00)00030-0
URL : https://hal.archives-ouvertes.fr/hal-00384697

R. David, A short proof of the strong normalization of the simply typed lambda calculus
URL : https://hal.archives-ouvertes.fr/hal-00382688

R. David and K. Nour, A short proof of the strong normalization of the simply typed ?µ-calculus, Schedae Informaticae, issue.12, pp.27-34, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00382688

R. David and K. Nour, Arithmetical proofs of strong normalization results for the symmetric lambda-mu-calculus, TLCA'2005, pp.162-178, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00382299

R. David and K. Nour, Arithmetical proofs of strong normalization results for symmetric ?-calculi
URL : https://hal.archives-ouvertes.fr/hal-00381602

P. De-groote, On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control, LPAR, pp.31-43, 1994.

P. De-groote, A CPS-Translation of the ?µ-Calculus, Proceedings 19th Intl. Coll. on Trees in Algebra and Programming, CAAP'94, pp.85-99, 1994.

J. Doyen, Quelques propriétés du typage des fonctions des entiers dans les entiers, C.R. Acad. Sci. Paris, t, vol.321, pp.663-665, 1995.

S. Fortune, D. Leivant, and M. O. Donnell, Simple and Second order Types Structures, pp.151-185, 1983.

H. Friedman, Equality between functionals. Logic Coll'73, pp.22-37, 1975.

J. Girard, Y. Lafont, and P. Taylor, Proofs and Types, 1989.

K. Gödel and ¨. , ??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

W. D. Goldfarb, The undecidability of the 2nd order unification problem, TCS, issue.13, pp.225-230, 1981.

G. P. Huet, The Undecidability of Unification in Third Order Logic Information and Control, pp.257-267, 1973.

F. Joachimski and R. Matthes, Short proofs of normalization for the simply-typed lambda-calculus, permutative conversions and Gödel's T. Archive for Mathematical Logic, pp.59-87, 2003.

A. Jung and J. A. Tiuryn, A new characterization of lambda definability, TLCA'1993, pp.245-257, 1993.
DOI : 10.1007/BFb0037110

J. Krivine, Un algorithme non typable dans le système F, C. R. Acad. Sci. Paris, vol.304, issue.5, 1987.

J. Krivine, Lambda Calcul : types et modèles, 1990.

J. Krivine, Classical logic, storage operators and second-order lambda-calculus, Annals of Pure and Applied Logic, vol.68, issue.1
DOI : 10.1016/0168-0072(94)90047-7

J. Lambek, Cartesian Closed Categories and Typed Lambda-calculi. Combinators and Functional Programming Languages, pp.136-175, 1985.

R. Loader, The Undecidability of ?-definability Essays in memory of A. Church, pp.331-342, 2001.

N. P. Mendler, Recursive Types and Type Constraints in Second-Order Lambda Calculus, LICS, pp.30-36, 1987.

N. P. Mendler, Inductive types and type constraints in the second-order lambda calculus, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.159-172, 1991.
DOI : 10.1016/0168-0072(91)90069-X

M. Parigot, Programming with proofs: A second order type theory, LNCS, vol.88, issue.300, pp.145-159, 1988.
DOI : 10.1007/3-540-19027-9_10

M. Parigot, On the representation of data in lambda-calculus, pp.309-321, 1989.
DOI : 10.1007/3-540-52753-2_47

M. Parigot, Recursive programming with proofs, Theoretical Computer Science, vol.94, issue.2, pp.335-356, 1992.
DOI : 10.1016/0304-3975(92)90042-E

M. Parigot, Strong normalization for second order classical natural deduction, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.39-46, 1993.
DOI : 10.1109/LICS.1993.287602

M. Parigot, ?µ-calculus: An algorithmic interpretation of classical natural deduction, Journal of symbolic logic, vol.624, pp.1461-1479, 1997.

M. Parigot, Abstract, The Journal of Symbolic Logic, vol.50, issue.04, pp.1461-1479, 1997.
DOI : 10.1145/322358.322370

G. D. Plotkin, Lambda-definability and logical relations, 1973.

H. Schwichtenberg, Definierbare Funktionen im??-Kalk??l mit Typen, Archiv f??r Mathematische Logik und Grundlagenforschung, vol.17, issue.3-4, pp.113-114, 1976.
DOI : 10.1007/BF02276799

R. Statman, The Typed lambda-Calculus is not Elementary Recursive, FOCS, pp.90-94, 1977.

R. Statman, ??-definable functionals and???? conversion, Archiv f??r Mathematische Logik und Grundlagenforschung, vol.9, issue.1, pp.21-26, 1983.
DOI : 10.1007/BF02023009

R. Statman, Recursive types and the subject reduction theorem, 1994.

W. W. Tait, Intensional interpretations of functionals of finite type I, The Journal of Symbolic Logic, vol.91, issue.02, 1967.
DOI : 10.1007/BF01447860

A. Weiermann, A proof of strongly uniform termination for G??del's $T$ by methods from local predicativity, Archive for Mathematical Logic, vol.36, issue.6, pp.445-460, 1997.
DOI : 10.1007/s001530050075