A. Asperti, About the efficient reduction of lambda terms. arXiv, 2017.

A. Asperti, P. Coppola, and S. Martini, (Optimal) duplication is not elementary recursive, Information and Computation, vol.193, issue.1, pp.21-56, 2004.
DOI : 10.1016/j.ic.2004.05.001
URL : http://www.cs.unibo.it/pub/martini/dupnotelem.pdf

A. Asperti, C. Giovannetti, and A. Naletto, Abstract, Journal of Functional Programming, vol.6, issue.06, pp.763-810, 1996.
DOI : 10.1017/S0956796800001994

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

A. Asperti and H. G. Mairson, Parallel Beta Reduction Is Not Elementary Recursive, Information and Computation, vol.170, issue.1, pp.49-80, 2001.
DOI : 10.1006/inco.2001.2869
URL : https://doi.org/10.1006/inco.2001.2869

A. Asperti and L. Roversi, Intuitionistic Light Affine Logic, ACM Transactions on Computational Logic, vol.3, issue.1, pp.137-175, 2002.
DOI : 10.1145/504077.504081

P. Baillot, P. Coppola, and U. D. Lago, Light logics and optimal reduction: Completeness and complexity, Information and Computation, vol.209, issue.2, pp.118-142, 2011.
DOI : 10.1016/j.ic.2010.10.002
URL : https://hal.archives-ouvertes.fr/hal-00798315

U. Dal and L. , Context semantics, linear logic, and computational complexity, ACM Transactions on Computational Logic (TOCL), vol.102532, issue.4, pp.1-25, 2009.

D. Lago and B. Accattoli, Leftmost-Outermost) Beta Reduction is Invariant, Indeed. Logical Methods in Computer Science, vol.12, issue.1, pp.10-2168, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01337712

U. Dal, L. , and S. Martini, On Constructor Rewrite Systems and the Lambda- Calculus, Automata, Languages and Programming, pp.163-174, 2009.

J. Girard, Geometry of Interaction 1: Interpretation of System F, 1988.
DOI : 10.1016/S0049-237X(08)70271-4

J. Girard, Light linear logic Information and Computation, pp.175-204, 1998.

G. 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

S. Guerrini, T. Leventis, and M. Solieri, Deep into optimality ? complexity and correctness of sharing implementation of bounded logics, Third International Workshop on Developments in Implicit Complexity, 2012.

S. Guerrini, S. Martini, and A. Masini, Modal Logic, Linear Logic, Optimal Lambda-Reduction, Logic and Foundations of Mathematics, number 280 in Synthese Library, pp.271-282, 1999.
DOI : 10.1007/978-94-017-2109-7_20

S. Guerrini, S. Martini, and A. Masini, Coherence for sharing proof-nets, Theoretical Computer Science, vol.294, issue.3, pp.379-40910, 2003.
DOI : 10.1016/S0304-3975(01)00162-1
URL : https://doi.org/10.1016/s0304-3975(01)00162-1

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

J. Lévy, Optimal reductions in the lambda-calculus, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.159-191, 1980.

L. P. Simon and . Jones, Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine, Journal of Functional Programming, vol.2, issue.2, pp.127-20210, 1992.

R. Statman, The typed ??-calculus is not elementary recursive, Theoretical Computer Science, vol.9, issue.1, pp.73-8110, 1979.
DOI : 10.1016/0304-3975(79)90007-0

. Peter-van-emde and . Boas, Machine models and simulations, Handbook of theoretical computer science A): algorithms and complexity, 1991.

P. Wadsworth, Semantics and pragmatics of the lambda-calculus, 1971.