R. M. Amadio, On Stratified Regions, Lecture Notes in Computer Science, vol.5904, pp.210-225, 2009.
DOI : 10.1007/978-3-642-10672-9_16
URL : https://hal.archives-ouvertes.fr/hal-00375232

R. M. Amadio and F. Dabrowski, Feasible reactivity in a synchronous pi-calculus, PPDP, pp.221-230, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00130322

R. M. Amadio and S. Dal-zilio, Resource control for synchronous cooperative threads, Theoretical Computer Science, vol.358, issue.2-3, pp.229-254, 2006.
DOI : 10.1016/j.tcs.2006.01.017
URL : https://hal.archives-ouvertes.fr/hal-00146983

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

P. Baillot and V. Mogbil, Soft lambda-Calculus: A Language for Polynomial Time Computation, Lecture Notes in Computer Science, vol.2987, pp.27-41, 2004.
DOI : 10.1007/978-3-540-24727-2_4
URL : https://hal.archives-ouvertes.fr/hal-00085129

P. Baillot, M. Gaboardi, and V. Mogbil, A PolyTime Functional Language from Light Linear Logic, Lecture Notes in Computer Science, vol.6012, pp.104-124, 2010.
DOI : 10.1007/978-3-642-11957-6_7
URL : https://hal.archives-ouvertes.fr/hal-00443944

G. Boudol, Typing termination in a higher-order concurrent imperative language, Information and Computation, vol.208, issue.6, pp.716-736, 2010.
DOI : 10.1016/j.ic.2009.06.007

P. Coppola and S. Martini, Optimizing optimal reduction, ACM Transactions on Computational Logic, vol.7, issue.2, pp.219-260, 2006.
DOI : 10.1145/1131313.1131315

P. Coppola, U. Dal-lago, and S. Rocca, Light Logics and the Call-by-Value Lambda Calculus, Logical Methods in Computer Science, vol.4, issue.4, 2008.
DOI : 10.2168/LMCS-4(4:5)2008

V. Danos and J. 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. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

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

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

U. D. Lago, S. Martini, and D. Sangiorgi, Light Logics and Higher-Order Processes, Electronic Proceedings in Theoretical Computer Science, vol.41, issue.8, pp.46-60, 2010.
DOI : 10.4204/EPTCS.41.4
URL : https://hal.archives-ouvertes.fr/hal-01400903

J. M. Lucassen and D. K. Gifford, Polymorphic effect systems, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.47-57, 1988.
DOI : 10.1145/73560.73564
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.4916

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. Marion and R. Péchoux, Complexity information flow in a multi-threaded imperative language. CoRR, abs/1203, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00684026

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