P. Baillot, Stratified coherence spaces: a denotational semantics for light linear logic, Theoretical Computer Science, vol.318, issue.1-2, pp.29-55, 2004.
DOI : 10.1016/j.tcs.2003.10.015

URL : https://hal.archives-ouvertes.fr/hal-00084609

P. Baillot, Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy, APLAS. Lecture Notes in Computer Science, vol.3, issue.1-2, pp.337-352, 2011.
DOI : 10.1016/S1571-0661(05)80409-8

URL : https://hal.archives-ouvertes.fr/hal-00624742

P. Baillot, D. Benedetti, E. Ronchi-della-rocca, and S. , Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus, Tech. rep, p.31, 2014.
DOI : 10.1007/978-3-662-44602-7_13

URL : https://hal.archives-ouvertes.fr/hal-01402039

S. Bellantoni and S. A. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992.
DOI : 10.1007/BF01201998

P. Coppola, U. Dal-lago, and S. Ronchi-della-rocca, Light logics and the call-byvalue lambda-calculus, Logical Methods in Computer Science, vol.4, issue.4, 2008.
DOI : 10.2168/lmcs-4(4:5)2008

URL : http://arxiv.org/abs/0809.0195

D. Lago and U. , Context semantics, linear logic, and computational complexity, ACM Transactions on Computational Logic, vol.10, issue.4, 2009.
DOI : 10.1145/1555746.1555749

URL : https://hal.archives-ouvertes.fr/hal-00088823

D. Lago, U. Masini, A. Zorzi, and M. , Quantum implicit computational complexity, Theoretical Computer Science, vol.411, issue.2, pp.377-409, 2010.
DOI : 10.1016/j.tcs.2009.07.045

V. Danos and J. B. Joinet, Linear logic and elementary time, Information and Computation, vol.183, issue.1, pp.123-137, 2003.
DOI : 10.1016/S0890-5401(03)00010-5

URL : http://doi.org/10.1016/s0890-5401(03)00010-5

J. Y. Girard, Light Linear Logic, Information and Computation, vol.143, issue.2, pp.175-204, 1998.
DOI : 10.1006/inco.1998.2700

N. D. Jones, Computability and complexity -from a programming perspective. Foundations of computing series, 1997.
DOI : 10.1007/978-94-010-0413-8_4

URL : http://dx.doi.org/10.1016/s0898-1221(97)90135-8

N. D. Jones, The expressive power of higher-order types or, life without CONS, Journal of Functional Programming, vol.11, issue.1, pp.5-94, 2001.
DOI : 10.1017/S0956796800003889

Y. Lafont, Soft linear logic and polynomial time, Theoretical Computer Science, vol.318, issue.1-2, pp.163-180, 2004.
DOI : 10.1016/j.tcs.2003.10.018

URL : http://doi.org/10.1016/j.tcs.2003.10.018

D. Leivant, Predicative recurrence and computational complexity I: word recurrence and poly-time, In: Feasible Mathematics II Birkhauser, pp.320-343, 1994.
DOI : 10.1007/978-1-4612-2566-9_11

D. Leivant, Calibrating computational feasibility by abstraction rank, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2002.
DOI : 10.1109/LICS.2002.1029842

D. Leivant and J. Y. Marion, Lambda calculus characterizations of poly-time, Fundam . Inform, vol.19, issue.12, pp.167-184, 1993.
DOI : 10.1007/BFb0037112

A. Madet, Implicit Complexity in Concurrent Lambda-Calculi, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00794977

A. Madet and R. M. Amadio, An Elementary Affine ??-Calculus with Multithreading and Side Effects, Lecture Notes in Computer Science, vol.46, issue.3-4, pp.138-152, 2011.
DOI : 10.1007/s00153-007-0042-6

URL : https://hal.archives-ouvertes.fr/hal-00610012

J. Y. Marion, A Type System for Complexity Flow Analysis, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.123-132, 2011.
DOI : 10.1109/LICS.2011.41

URL : https://hal.archives-ouvertes.fr/hal-00591853

D. Mazza, Linear logic and polynomial time, Mathematical Structures in Computer Science, vol.16, issue.06, pp.947-988, 2006.
DOI : 10.1017/S0960129506005688

R. Della-rocca, S. Paolini, and L. , The Parametric Lambda-Calculus: a Metamodel for Computation. Texts in Theoretical Computer Science, pp.5-40356, 2004.

R. Della-rocca, S. Roversi, and L. , Lambda-calculus and intuitionistic linear logic, Studia Logica, vol.59, issue.3, pp.417-448, 1997.
DOI : 10.1023/A:1005092630115

K. Terui, Light affine lambda calculus and polynomial time strong normalization, Archive for Mathematical Logic, vol.98, issue.1, pp.253-280, 2007.
DOI : 10.1007/s00153-007-0042-6