R. M. Amadio, P. Baillot, A. Atassi, P. Baillot, and K. Terui, An affine-intuitionistic system of types and effects: confluence and termination. CoRR, abs/1005 Verification of ptime reducibility for system f terms: Type inference in dual light affine logic, Logical Methods in Computer Science, vol.0835, issue.34, pp.23-176, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00438101

M. Roberto, M. Amadio, and . Dogguy, On affine usages in signal-based communication, Lecture Notes in Computer Science, vol.5356, pp.221-236, 2008.

W. Andrew, D. A. Appel, and . Mcallester, An indexed model of recursive types for foundational proof-carrying code, ACM Transactions on Programming Languages and Systems, vol.23, issue.5, pp.657-683, 2001.

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

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. Barber, Dual intuitionistic linear logic, p.47, 1996.

]. P. Bbdph93, G. M. Benton, V. Bierman, M. De-paiva, and . Hyland, A term calculus for intuitionistic linear logic, Marc 179

J. Bezem, . Friso-groote-stephen, S. A. Bellantoni, . N. Cookben94-]-p, and . Benton, A new recursiontheoretic characterization of the polytime functions A mixed linear and non-linear logic: Proofs, terms and models, CSL, volume 933 of Lecture Notes in Computer Science, pp.75-90, 1992.

A. Brunel, M. G. , P. Baillot, M. Gaboardi, and V. Mogbil, Quantitative reducibility candidates for dlpcf Third International Workshop on Developments in Implicit Complexity A polytime functional language from light linear logic Baillot and Virgile Mogbil. Soft lambda-calculus: A language for polynomial time computation, ESOP FoSSaCS, volume 2987 of Lecture Notes in Computer Science, pp.177-104, 2004.

A. Brunel and A. Madet, Indexed Realizability for Bounded-Time Programming with References and Type Fixpoints, Lecture Notes in Computer Science, vol.7705, pp.264-279, 2012.
DOI : 10.1007/978-3-642-35182-2_19
URL : https://hal.archives-ouvertes.fr/hal-00735584

G. Boudol, Typing termination in a higher-order concurrent imperative language. Information and Computation, pp.716-736, 2010.

A. Brunel, Quantitative classical realizability. submitted, 2012, Light types for polynomial time computation in lambda calculus. Information and Computation, pp.16241-62, 2009.

P. Baillot and K. Terui, Light types for polynomial time computation in lambda calculus, Information and Computation, vol.207, issue.1, pp.41-62, 2009.
DOI : 10.1016/j.ic.2008.08.005
URL : https://hal.archives-ouvertes.fr/hal-00012752

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

A. Church, A Set of Postulates For the Foundation of Logic, The Annals of Mathematics, vol.34, issue.4, pp.839-864, 1933.
DOI : 10.2307/1968702

D. , V. Danos, J. Danos, J. Joinet, and H. Schellinx, Linear logic and elementary time Information and Computation On the linear decoration of intuitionistic derivations, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011 10.1007/BF02390456. 52 [FMA06] Matthew Fluet, Greg Morrisett, and Amal J. Ahmed. Linear regions are all you need, pp.183123-137, 1995.

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 An implicit characterization of pspace, ACM Transactions on Computational Logic, vol.143, issue.132, pp.175-204, 1998.

M. Gaboardi and S. Rocca, From light logics to type assignments: a case study, Logic Journal of IGPL, vol.17, issue.5, pp.499-530, 2009.
DOI : 10.1093/jigpal/jzp019

A. Igarashi and N. Kobayashi, Resource usage analysis, ACM Transactions on Programming Languages and Systems, vol.27, issue.2, pp.264-313, 2005.
DOI : 10.1145/1057387.1057390

[. Jost, K. Hammond, H. Loidl, M. Hofmannkle73, and ]. S. Kleene, Static determination of quantitative resource usage for higher-order programs Realizability: A retrospective survey, POPL Cambridge Summer School in Mathematical Logic, pp.223-236, 1973.

N. Kobayashi, Type Systems for Concurrent Programs, 10th BIBLIOGRAPHY Anniversary Colloquium of UNU/IIST, pp.439-453, 1999.
DOI : 10.1007/978-3-540-40007-3_26

J. Krivine, Realizability in classical logic. Panoramas et synthèses, pp.197-229, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00154500

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

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

D. Leivant, A foundational delineation of computational feasiblity, LICS, pp.2-11, 1991.

M. John, D. K. Lucassen, and . Gifford, Polymorphic effect systems, POPL, pp.47-57, 1988.

U. Dal, L. , and M. Gaboardi, Linear dependent types and relative completeness, LICS [DBL11], pp.133-142

U. Dal, L. , and P. D. Giamberardino, Soft session types, EPTCS, vol.64, issue.21, pp.59-73, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00616388

U. Dal, L. , and M. Hofmann, A semantic proof of polytime soundness of light affine logic, Theory of Computing Systems, vol.46, pp.673-689, 2010.

U. Dal, L. , and M. Hofmann, Realizability models and implicit complexity Girard's Festschrift, Theoretical Computer Science, vol.412, issue.153, pp.2029-2047, 2011.

U. Dal-lago, T. Heindel, D. Mazza, and D. Varacca, Computational complexity of interactive behaviors. CoRR, abs, 1209.

U. Dal-lago, S. Martini, and D. Sangiorgi, Light Logics and Higher-Order Processes, EXPRESS'10, pp.46-60, 2010.
DOI : 10.4204/EPTCS.41.4
URL : https://hal.archives-ouvertes.fr/hal-01400903

U. Dal, L. , and B. Petit, The geometry of types, p.177, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00909318

A. Madet and R. M. Amadio, An Elementary Affine ??-Calculus with Multithreading and Side Effects
DOI : 10.1007/s00153-007-0042-6
URL : https://hal.archives-ouvertes.fr/hal-00610012

A. Madet, A polynomial time ??-calculus with multithreading and side effects, Proceedings of the 14th symposium on Principles and practice of declarative programming, PPDP '12, pp.55-66, 2012.
DOI : 10.1145/2370776.2370785
URL : https://hal.archives-ouvertes.fr/hal-00735544

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

[. Maraist, M. Odersky, D. N. Turner, and P. Wadler, Call-by-name, call-by-value, call-by-need and the linear lambda calculus, Theoretical Computer Science, vol.228, issue.1-2, pp.175-210, 1999.
DOI : 10.1016/S0304-3975(98)00358-2

J. , G. Morrisett, D. Walker, K. Crary, and N. Glew, From system f to typed assembly language, ACM Transactions on Programming Languages and Systems, vol.21, issue.3, pp.527-568, 1999.

H. Nakano, A modality for recursion, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.255-266, 2000.
DOI : 10.1109/LICS.2000.855774

G. D. Plotkin, Type theory and recursion (extended abstract ) [Pot11] François Pottier. A typed store-passing translation for general references, LICS, page 374. IEEE Computer Society POPL, pp.47-147, 1993.

L. Tofte, M. Birkedal, N. Elsman, T. Hallenberg, O. Højfeld et al., Programming with regions in the mlkit revised for version 4.3.0, Mads Tofte, Lars Birkedal, Martin Elsman, and Niels Hallenberg. A retrospective on region-based memory management. Higher- Order and Symbolic Computation, pp.45245-265, 2004.

K. Terui, Light affine lambda calculus and polynomial time strong normalization Archive for Mathematical Logic, pp.3-4253, 2007.

P. Tranquilli, Translating types and effects with state monads and linear logic, p.173, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00465793

[. Tofte, J. Talpinwad80, and ]. C. Wadsworth, Region-based memory management Information Computation Some unusual ?-calculus numeral systems, To HB Curry: Essays on combinatory logic, lambda calculus and formalism, pp.109-176, 1980.

[. Wadler, A taste of linear logic, MFCS, pp.185-210
DOI : 10.1007/3-540-57182-5_12

D. Springer, K. Walker, and . Watkins, On regions and linear types, pp.47-181, 1993.