M. Abadi, L. Cardelli, P. Curien, and J. Evy, Explicit Substitutions. A CM conference on Principles of Programming Languages, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075382

P. Audebaud, Environment machines for functional languages extended with control structures. ENS-Lyon Research

P. Curien, T. Hardin, and J. Evy, Connuence p r operties of weak and strong calculi of explicit substitutions, INRIA Research R, p.1617

]. T. Gri90 and . Griin, Y formulae-as-types notion of control, Proceedings of POPL, 1990.

. Ph and . De-groote, On the relation between the -calculus and the syntactic theory of sequential control, Proceedings of 5th International Conference, LPAR'94

T. Hardin and J. Evy, A c onnuent calculus of substitutions, F rance-Japan Artiicial Intelligence and Computer Science Symposium, 1989.

M. Parigot, -calculus: an algorithmic interpretation of Classical Natural Deduction, Proc. International Conference on Logic Programming and Automated Reasoning, vol.624, pp.190-201, 1991.

M. Parigot, Strong normalization for the second order classical natural deduction, Proceedings of the eight a n n ual IEEE symposium on Logic in Computer Science, LICS'93

M. Parigot, Classical Proofs as Programs, Proceedings of the third Kurt GG odel Colloquium KGC'93, vol.733