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
Intuitionistic Light Affine Logic, ACM Transactions on Computational Logic, vol.3, issue.1, pp.137-175, 2002. ,
DOI : 10.1145/504077.504081
Higher-order interpretations and program complexity, CSL'12, pp.62-76, 2012. ,
DOI : 10.1016/j.ic.2015.12.008
URL : https://hal.archives-ouvertes.fr/hal-01337728
Linear logic by levels and bounded time complexity, Theoretical Computer Science, vol.411, issue.2, pp.470-503, 2010. ,
DOI : 10.1016/j.tcs.2009.09.015
URL : https://hal.archives-ouvertes.fr/hal-00488531
Light types for polynomial time computation in lambda-calculus, LICS '04, pp.266-275, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00012752
A PolyTime Functional Language from Light Linear Logic, ESOP'10, 2010. ,
DOI : 10.1007/978-3-642-11957-6_7
URL : https://hal.archives-ouvertes.fr/hal-00443944
A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992. ,
DOI : 10.1007/BF01201998
Pola: a language for PTIME programming, LCC'09, 2009. ,
Functional interpretations of feasibly constructive arithmetic, STOC '89, pp.107-112, 1989. ,
Interpretation of stream programs: characterizing type 2 polynomial time complexity, ISAAC'10, pp.291-303, 2010. ,
Structural polymorphism, Theoretical Computer Science, vol.115, issue.1, pp.107-129, 1993. ,
DOI : 10.1016/0304-3975(93)90057-Z
URL : http://doi.org/10.1016/0304-3975(93)90057-z
Upper bounds on stream I/O using semantic interpretations [13] M. Gaboardi and R. Péchoux. Global and local space properties of stream programs, CSL '09 FOPARA'09, pp.271-286, 2009. ,
A Soft Type Assignment System for ??-Calculus, CSL '07, pp.253-267, 2007. ,
DOI : 10.1007/978-3-540-74915-8_21
Soft Linear Logic and Polynomial Complexity Classes, LSFA 2007, pp.67-87 ,
DOI : 10.1016/j.entcs.2008.03.066
URL : https://hal.archives-ouvertes.fr/hal-00342320
A logical account of PSPACE, POPL'08, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00342323
A By-Level Analysis of Multiplicative Exponential Linear Logic, MFCS'09, pp.344-355, 2009. ,
DOI : 10.2307/2695106
Inductive and coinductive types with iteration and recursion, Types for Proofs and Programs, pp.193-217, 1992. ,
The Blind Spot: Lectures on Logic, 2011. ,
DOI : 10.4171/088
URL : https://hal.archives-ouvertes.fr/hal-01322183
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
Proofs and Types, volume 7 of Cambridge tracts in theoretical computer science, 1989. ,
A typed lambda calculus with categorical type constructors, Category Theory and Computer Science, pp.140-57, 1987. ,
DOI : 10.1007/3-540-18508-9_24
Arithmetical hierarchy and complexity of computation, Theoretical Computer Science, vol.8, issue.2, pp.227-237, 1979. ,
DOI : 10.1016/0304-3975(79)90046-X
Programming languages capturing complexity classes, ACM SIGACT News, vol.31, issue.1, pp.31-42, 2000. ,
DOI : 10.1145/346048.346051
A tutorial on (co) algebras and (co) induction, EATCS, vol.62, pp.222-259, 1997. ,
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
On light logics, uniform encodings and polynomial time, MSCS'06, pp.713-733, 2006. ,
DOI : 10.1017/S0960129506005421
URL : https://hal.archives-ouvertes.fr/hal-00019515
Implicit complexity for coinductive data: a characterization of corecurrence, DICE'12, pp.1-14, 2012. ,
DOI : 10.4204/EPTCS.75.1
The Computational Contents of Ramified Corecurrence, FOSSACS, 2015. ,
DOI : 10.1007/978-3-662-46678-0_27
Monotone (co)inductive types and positive fixed-point types, RAIRO - Theoretical Informatics and Applications, vol.33, issue.4-5, pp.309-328, 1999. ,
DOI : 10.1051/ita:1999120
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.9265
Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus, ICALP'14, pp.305-317, 2014. ,
DOI : 10.1007/978-3-662-43951-7_26
On an interpretation of safe recursion in light affine logic, Theoretical Computer Science, vol.318, issue.1-2, pp.197-223, 2004. ,
DOI : 10.1016/j.tcs.2003.10.017
Types and Programming Languages, 2002. ,
Ramified Corecurrence and Logspace, Electronic Notes in Theoretical Computer Science, vol.276, issue.0, pp.276247-26111, 2011. ,
DOI : 10.1016/j.entcs.2011.09.025
URL : http://doi.org/10.1016/j.entcs.2011.09.025
Safe Recursion on Notation into a Light Logic by Levels, DICE'10, pp.63-77, 2010. ,
DOI : 10.4204/EPTCS.23.5
Stratified Bounded Affine Logic for Logarithmic Space, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.411-420, 2007. ,
DOI : 10.1109/LICS.2007.45
Light affine lambda calculus and polytime strong normalization, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.209-220, 2001. ,
DOI : 10.1109/LICS.2001.932498
Recursive types for free! Technical report, 1990. ,
A note on categorical datatypes, CTCS, pp.118-127, 1993. ,