Subpolynomial complexity classes of real functions and real numbers, ICALP 1986, vol.226, pp.284-293, 1986. ,
Complexity Theory of Real Functions, 1991. ,
Computable Analysis: an Introduction, 2000. ,
Complexity theory for operators in analysis, TOCT, vol.4, issue.2, p.24, 2012. ,
Feasible real random access machines, J. Comp, vol.14, issue.4, pp.490-526, 1998. ,
A certified, corecursive implementation of exact real numbers, TCS, vol.351, pp.39-51, 2006. ,
A language for differentiable functions, FOS-SACS 2013, pp.337-352, 2013. ,
The differential lambda-calculus, TCS, vol.309, issue.1-3, pp.1-41, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00150572
Light linear logic, Inf. Comput, vol.143, issue.2, pp.175-204, 1998. ,
Linear types and non-size-increasing polynomial time computation, Inf. Comput, vol.183, issue.1, pp.57-85, 2003. ,
A soft type assignment system for lambda -calculus, CSL 2007, pp.253-267, 2007. ,
Light types for polynomial time computation in ?-calculus, Inf. Comput, vol.207, issue.1, pp.41-62, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00012752
Parsimonious types and non-uniform computation, ICALP 2015, Proceedings, Part II, pp.350-361, 2015. ,
Simple parsimonious types and logarithmic space, CSL 2015, pp.24-40, 2015. ,
Beta reduction is invariant, indeed, CSL-LICS '14, vol.8, pp.1-8, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01091551
On bounding space usage of streams using interpretation analysis, Science of Computer Programming, vol.111, pp.395-425, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01112161
Characterizing polynomial time complexity of stream programs using interpretations, TCS, vol.585, pp.41-54, 2015. ,
Algebras and coalgebras in the light affine lambda calculus, ICFP 2015, pp.114-126, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01112165
Infinitary lambda calculi from a linear perspective, LICS 2016, pp.447-456, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01400883
The complexity of real recursive functions, UMC 2002, vol.2509, pp.1-14, 2002. ,
Algebraic characterizations of complexitytheoretic classes of real functions, Int. J. Unconventional Computing, vol.7, issue.5, pp.331-351, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00644361
, The Computational Contents of Ramified Corecurrence, pp.422-435, 2015.
From coinductive proofs to exact real arithmetic: theory and applications, Logical Methods in Computer Science, vol.7, issue.1, 2011. ,
Proofs, programs, processes, Theory Comput. Syst, vol.51, issue.3, pp.313-329, 2012. ,
A theory of program size formally identical to information theory, Journal of the ACM, vol.22, issue.3, pp.329-340, 1975. ,
Type inference for light affine logic via constraints on words, Theoretical Computer Science, vol.328, issue.3, pp.289-323, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00084611
Verification of ptime reducibility for system F terms: Type inference in dual light affine logic, Logical Methods in Computer Science, vol.3, issue.4, 2007. ,
Infinitary lambda calculus, TCS, vol.175, issue.1, pp.93-125, 1997. ,