S. Alves and M. Florido, Weak linearization of the lambda calculus, Theoretical Computer Science, vol.342, issue.1, pp.79-103, 2005.
DOI : 10.1016/j.tcs.2005.06.005

A. Asperti, Light affine logic, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), pp.300-308, 1998.
DOI : 10.1109/LICS.1998.705666

A. Asperti and J. Chroboczek, Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations Applicable Algebra in Engineering, Communication and Computing, pp.437-468, 1997.

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 C. Laneve, Paths, computations and labels in the ??-calculus, Theoretical Computer Science, vol.142, issue.2, pp.277-297, 1995.
DOI : 10.1016/0304-3975(94)00279-7

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 : http://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

A. Asperti, V. Danos, C. Laneve, and L. Regnier, Paths in the lambda-calculus, Logic in Computer Science, pp.426-436, 1994.

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, P. Coppola, and S. Martini, (Optimal) Duplication is not elementary recursive, Information and Computation, vol.193, 2004.
DOI : 10.1016/j.ic.2004.05.001
URL : http://doi.org/10.1016/j.ic.2004.05.001

C. Aubert and T. Seiller, Characterizing co-NL by a group action, Mathematical Structures in Computer Science, vol.75, issue.04, pp.1-33, 2014.
DOI : 10.1147/rd.105.0388
URL : https://hal.archives-ouvertes.fr/hal-01005705

C. Aubert and T. Seiller, Logarithmic Space and Permutations. Information and Computation URL https://haa.archives-ouvertes.fr/ haa-01005701/document, 2015.
DOI : 10.1016/j.ic.2014.01.018
URL : https://hal.archives-ouvertes.fr/hal-01005701

C. Aubert, M. Bagnol, and T. Seiller, Unary Resolution: Characterizing Ptime, Foundations of Software Science and Computation Structures, number 9634 in Lecture Notes in Computer Science, pp.373-389978, 1007.
DOI : 10.1145/321250.321253
URL : https://hal.archives-ouvertes.fr/hal-01321239

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

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

G. Boudol, The Lambda-calculus with multiplicities URL https, 1993.

A. Carraro and G. Guerrieri, A Semantical and Operational Account of Call-by-Value Solvability, Foundations of Software Science and Computation Structures, number 8412 in Lecture Notes in Computer Science, pp.103-118
DOI : 10.1007/978-3-642-54830-7_7

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

U. Dal, L. , and P. Baillot, On light logics, uniform encodings and polynomial time, Mathematical Structures in Computer Science, vol.16, issue.4, pp.713-733, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00019515

U. Dal-lago, C. Faggian, I. Hasuo, and A. Yoshimizu, The geometry of synchronization, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-35
DOI : 10.1145/2603088.2603154
URL : https://hal.archives-ouvertes.fr/hal-01091560

U. Dal-lago, C. Faggian, B. Valiron, and A. Yoshimizu, Parallelism and Synchronization in an Infinitary Context, 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp.559-572, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01231813

V. Danos and T. Ehrhard, Probabilistic coherence spaces as a model of higherorder probabilistic computation Information and Computation, pp.966-991, 2011.

V. Danos and L. Regnier, The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-203, 1989.
DOI : 10.1007/BF01622878

V. Danos and L. Regnier, Proof-nets and the Hilbert space, Advances in Linear Logic, pp.307-328, 1995.
DOI : 10.1017/CBO9780511629150.016
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.8944

V. Danos, M. Pedicini, and L. Regnier, Directed virtual reductions, Computer Science Logic, number 1258 in Lecture Notes in Computer Science, pp.76-88, 1997.
DOI : 10.1007/3-540-63172-0_33
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.1218

M. De and F. , The geometry of interaction of differential interaction nets, Logic in Computer Science LICS'08. 23rd Annual IEEE Symposium on, pp.465-475, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00392294

R. D. , C. , D. Kesner, and E. Polonovski, Proof Nets and Explicit Substitutions, Foundations of Software Science and Computation Structures, number 1784 in Lecture Notes in Computer Science, pp.63-81, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00148842

T. Ehrhard and L. Regnier, Differential interaction nets, S0304397506005299. Logic, Language, Information and Computation11th Workshop on Logic, Language, Information and Computation, pp.166-195, 2006.
DOI : 10.1016/j.tcs.2006.08.003
URL : https://hal.archives-ouvertes.fr/hal-00150274

T. Ehrhard and L. Regnier, The differential lambda-calculus, Theoretical Computer Science, vol.309, issue.1-3, pp.1-41, 2003.
DOI : 10.1016/S0304-3975(03)00392-X
URL : https://hal.archives-ouvertes.fr/hal-00150572

T. Ehrhard and L. Regnier, Differential Interaction Nets, Electronic Notes in Theoretical Computer Science, vol.123, pp.35-74, 2005.
DOI : 10.1016/j.entcs.2004.06.060
URL : https://hal.archives-ouvertes.fr/hal-00150274

T. Ehrhard and L. Regnier, B??hm Trees, Krivine???s Machine and the Taylor Expansion of Lambda-Terms, Logical Approaches to Computational Barriers, pp.186-197, 2006.
DOI : 10.1093/logcom/10.3.411

T. Ehrhard and L. Regnier, Uniformity and the Taylor expansion of ordinary lambda-terms, Theoretical Computer Science, vol.403, issue.2-3, pp.347-372, 2008.
DOI : 10.1016/j.tcs.2008.06.001
URL : https://hal.archives-ouvertes.fr/hal-00150275

M. Fernández, I. Mackie, and F. Sinot, Closed reduction: explicit substitutions without $\alpha$ -conversion, Mathematical Structures in Computer Science, vol.15, issue.2, pp.343-381, 2005.
DOI : 10.1017/S0960129504004633
URL : https://hal.archives-ouvertes.fr/inria-00133318

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

J. Girard, Geometry of interaction I: Interpretation of System F. Studies in Logic and the Foundations of, Mathematics, vol.127, issue.08, pp.221-260, 1989.

J. Girard, Light linear logic, Logic and computational complexity, pp.145-176, 1995.
DOI : 10.1007/3-540-60178-3_83

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

G. Gonthier, M. Abadi, and J. Lévy, Linear logic without boxes, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.223-234, 1992.
DOI : 10.1109/LICS.1992.185535
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.3076

G. Guerrieri and L. Tortora-de-falco, A new point of view on the Taylor expansion of proof-nets and uniformity, Presented at Linearity 2014, the third International Workshop on Linearity, 2014.

S. Guerrini, A general theory of sharing graphs, Theoretical Computer Science, vol.227, issue.1-2, 1999.
DOI : 10.1016/S0304-3975(99)00050-X

S. Guerrini, S. Martini, and A. Masini, Coherence for sharing proof-nets. Theoretical computer science, pp.379-409, 2003.
DOI : 10.1016/s0304-3975(01)00162-1
URL : http://doi.org/10.1016/s0304-3975(01)00162-1

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

V. Kathail, Optimal Interpreters for lambda-calculus based functional languages, 1990.

J. Krivine, A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation, pp.199-207, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00154508

Y. Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.95-108, 1990.
DOI : 10.1145/96709.96718

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, 1989.
DOI : 10.1145/96709.96711

O. Laurent, A Token Machine for Full Geometry of Interaction (Extended Abstract)
DOI : 10.1007/3-540-45413-6_23

O. Laurent, Étude de la polarisation en logique. phdthesis, Université de la Méditerranée -Aix-Marseille II, 2002.

J. Lévy, Réductions Correctes et Optimales dans le Lambda Calcul, 1978.

J. Lévy, Optimal Reductions in the Lambda-Calculus, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, 1980.

I. Mackie, The geometry of interaction machine, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '95, pp.198-208, 1995.
DOI : 10.1145/199448.199483

I. Mackie, Efficient lambda-Evaluation with Interaction Nets, Rewriting Techniques and Applications, number 3091 in Lecture Notes in Computer Science, pp.155-169, 1007.
DOI : 10.1007/978-3-540-25979-4_11

G. Harry and . Mairson, From hilbert spaces to dilbert spaces: Context semantics made simple, 22 Nd Conference on Foundations of Software Technology and Theoretical Computer Science, pp.2-17, 2002.

D. Mazza, Simple Parsimonious Types and Logarithmic Space, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), volume 41 of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.24-40, 2015.

D. Mazza and M. Pagani, The Separation Theorem for Differential Interaction Nets Artificial Intelligence, and Reasoning, number 4790 in Lecture Notes in Computer Science, Logic for Programming, pp.393-407, 1007.

D. Mazza and K. Terui, Parsimonious Types and Non-uniform Computation, Automata, Languages, and Programming, Proceedings of IC- ALP, pp.350-361978
DOI : 10.1007/978-3-662-47666-6_28

M. Pagani and C. Tasson, The Inverse Taylor Expansion Problem in Linear Logic, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.222-231, 2009.
DOI : 10.1109/LICS.2009.35
URL : https://hal.archives-ouvertes.fr/hal-00440684

M. Pagani and L. Tortora-de-falco, Strong normalization property for second order linear logic, Theoretical Computer Science, vol.411, issue.2, pp.410-444, 2010.
DOI : 10.1016/j.tcs.2009.07.053
URL : https://hal.archives-ouvertes.fr/hal-00698979

M. Pagani and P. Tranquilli, Parallel Reduction in Resource Lambda-Calculus, Programming Languages and Systems, 7th Asian Symposium, pp.226-242, 2009.
DOI : 10.1007/978-3-642-10672-9_17
URL : https://hal.archives-ouvertes.fr/hal-00699013

M. Pagani, P. Selinger, and B. Valiron, Applying uantitative Semantics to Higher-Order uantum Computing, The 41th Annual ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages, 2014.

M. Pedicini and F. Uaglia, PELCR, ACM Transactions on Computational Logic, vol.8, issue.3, 2007.
DOI : 10.1145/1243996.1243997

M. Pedicini, G. Pellitta, and M. Piazza, Sequential and Parallel Abstract Machines for Optimal Reduction, Preproceedings of the 15th Symposium on Trends in Functional Programming, p.2014

J. Sousa and P. , Parallel Implementation Models for the ??-Calculus Using the Geometry of Interaction (Extended Abstract), Typed Lambda Calculi and Applications, pp.385-399, 2001.
DOI : 10.1007/3-540-45413-6_30

L. Regnier, Lambda-calcul et réseaux, 1992.

M. Solieri, Ottimalità dell'ottimalità: complessità della riduzione su grafi di condivisione Master's thesis, Alma Mater Studiorum, 2011.

M. Solieri, Geometry of Resource Interaction and Taylor-Ehrhard-Regnier Expansion of Lambda-terms -A Minimalist Approach, Mathematical Structures in Computer Science, 2016.

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

P. Tranquilli, Intuitionistic differential nets and lambda-calculus, Theoretical Computer Science, vol.412, issue.20, pp.1979-1997, 2011.
DOI : 10.1016/j.tcs.2010.12.022
URL : http://doi.org/10.1016/j.tcs.2010.12.022

L. Vaux, On Linear Combinations of ??-Terms, Term Rewriting and Applications, pp.374-388, 2007.
DOI : 10.1007/978-3-540-73449-9_28
URL : https://hal.archives-ouvertes.fr/hal-00383896