M. Abadi, L. Cardelli, P. Curien, and J. Lévy, Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991.
DOI : 10.1016/0304-3975(86)90035-6

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

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 and B. Guillaume, A ??-calculus with explicit weakening and explicit substitution, Mathematical Structures in Computer Science, vol.11, issue.1, pp.169-206, 2001.
DOI : 10.1017/S0960129500003224
URL : https://hal.archives-ouvertes.fr/hal-00384683

B. Guillaume, Un calcul de substitutions avecétiquettesavecétiquettes, 1999.

P. Mellì-es, Typed ?-calculi with explicit substitutions may not terminate, Proceedings of Typed Lambda Calculi and Applications 95 in Lecture Notes in Computer Science, pp.328-334, 1995.

D. Kesner, R. Di-cosmo, and E. Polonovsky, Proof nets and explicit subsitutions, Fossacs'2000 and LNCS, pp.63-81, 2000.