[. Abadi, L. Cardelli, P. Louis-curien, and J. Lévy, Explicit substitutions, Journal of Functional Programming, vol.4, issue.1, pp.375-416, 1991.
URL : https://hal.archives-ouvertes.fr/inria-00075382

A. Asperti and S. Guerrini, The Optimal Implementation of Functional Programming Languages, volume 45 of Cambridge Tracts in Theoretical Computer Science, 1998.

B. Accattoli and S. Guerrini, Jumping boxes. representing lambda-calculus boxes by jumps, Proceedings of the 18th Annual Conference of the European Association for Computer Science Logic (CSL), 2009.

B. Accattoli and D. Kesner, The structural ?calculus, Proceedings of the 19th Annual Conference of the European Association for Computer Science Logic (CSL), Lecture Notes in Computer Science, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00528228

H. Barendregt, The Lambda Calculus: Its Syntax and Semantics , volume 103 of Studies in Logic and the Foundations of Mathematics, 1984.

[. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-degli, Abstract, Journal of Functional Programming, vol.1, issue.05, pp.699-722, 1996.
DOI : 10.1145/174675.174707

. Bloo, Preservation of Termination for Explicit Substitution, 1997.

G. Nicolaas and . De-bruijn, Generalizing automath by means of a lambda-typed lambda calculus, Mathematical Logic and Theoretical Computer Science, number 106 in Lecture Notes in Pure and Applied Mathematics, p.7192, 1987.

[. Cosmo, D. Kesner, and E. Polonovski, Proof Nets and Explicit Substitutions, Mathematical Structures in Computer Science, vol.13, issue.3, pp.409-450, 2003.
DOI : 10.1007/3-540-46432-8_5
URL : https://hal.archives-ouvertes.fr/hal-00148842

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

V. Danos and L. Regnier, Local and asynchronous beta-reduction (an analysis of Girard's execution formula), [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.296-306, 1993.
DOI : 10.1109/LICS.1993.287578

I. Fernández, F. Mackie, and . Sinot, Lambda-Calculus with Director Strings, Applicable Algebra in Engineering, Communication and Computing, vol.11, issue.6, pp.393-437, 2005.
DOI : 10.1007/s00200-005-0169-9
URL : https://hal.archives-ouvertes.fr/inria-00133315

[. Gonthier, M. Abadi, and J. Lévy, The geometry of optimal lambda reduction, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.15-26, 1992.
DOI : 10.1145/143165.143172

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

D. Kesner, The Theory of Calculi with Explicit Substitutions Revisited, 16th EACSL Annual Conference on Computer Science and Logic (CSL), pp.238-252, 2007.
DOI : 10.1007/978-3-540-74915-8_20
URL : https://hal.archives-ouvertes.fr/hal-00111285

[. Kesner, Perpetuality for Full and Safe Composition (in a Constructive Setting), Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), Part II, pp.311-322, 2008.
DOI : 10.1007/978-3-540-70583-3_26
URL : https://hal.archives-ouvertes.fr/hal-00524782

Z. Khasidashvili, Expression reduction systems, Proceedings of IN Vekua Institute of Applied Mathematics, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00148530

D. Kesner and S. Lengrand, Resource operators for lambda-calculus. Information and Computation, pp.419-473, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00148539

[. Kamareddine, T. Laan, and R. Nederpelt, Pure type systems with parameters and definitions. In A Modern Perspective on Type Theory, of Applied Logic Series, pp.255-310, 2005.

J. Klop, Combinatory Reduction Systems, Mathematical Centre Tracts. Mathematisch Centrum, vol.127, 1980.

F. Kamareddine and A. Ríos, A ??-calculus ?? la de Bruijn with explicit substitutions, Doaitse Swierstra and Manuel Hermenegildo Proceedings of the 7th International Symposium on Proceedings of the International Symposium on Programming Language Implementation and Logic Programming, pp.45-62, 1995.
DOI : 10.1007/BFb0026813

D. Kesner and F. Renaud, The Prismoid of Resources, The 34th International Symposium on Mathematical Foundations of Computer Science, pp.464-476, 2009.
DOI : 10.1007/BFb0014062
URL : https://hal.archives-ouvertes.fr/inria-00519503

J. Lamping, An algorithm for optimal lambda calculus reduction, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.16-30, 1990.
DOI : 10.1145/96709.96711

P. Es, Typed ?-calculi with explicit substitutions may not terminate, Proceedings of the 2nd International Conference of Typed Lambda Calculus and Applications (TLCA), 1995.

R. Milner, Local bigraphs and confluence: Two conjectures: (extended abstract) Electronic Notes in Theoretical Computer Science, pp.65-73, 2007.

]. Ned92, . P. Robert, and . Nederpelt, The fine-structure of lambda calculus, 1992.

[. Nipkow, Higher-order critical pairs, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.342-349, 1991.
DOI : 10.1109/LICS.1991.151658

O. Shané and . Conchúir, Proving PSN by simulating non-local substitutions with local substitution, Proceedings of the Third International Workshop on Higher-Order Rewriting (HOR) Proc. available as http, pp.37-42, 2006.

[. Renaud, Preservation of strong normalisation for lambda-s Available on http, 2008.

P. Severi and E. Poll, Pure Type Systems with definitions, Logical Foundations of Computer Science'94
DOI : 10.1007/3-540-58140-5_30