N. T. Müller, Subpolynomial complexity classes of real functions and real numbers, ICALP 1986, vol.226, pp.284-293, 1986.

K. I. Ko, Complexity Theory of Real Functions, 1991.

K. Weihrauch, Computable Analysis: an Introduction, 2000.

A. Kawamura and S. A. Cook, Complexity theory for operators in analysis, TOCT, vol.4, issue.2, p.24, 2012.

V. Brattka and P. Hertling, Feasible real random access machines, J. Comp, vol.14, issue.4, pp.490-526, 1998.

A. Ciaffaglione and P. Di-gianantonio, A certified, corecursive implementation of exact real numbers, TCS, vol.351, pp.39-51, 2006.

P. D. Gianantonio and A. Edalat, A language for differentiable functions, FOS-SACS 2013, pp.337-352, 2013.

T. Ehrhard and L. Regnier, The differential lambda-calculus, TCS, vol.309, issue.1-3, pp.1-41, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00150572

J. Girard, Light linear logic, Inf. Comput, vol.143, issue.2, pp.175-204, 1998.

M. Hofmann, Linear types and non-size-increasing polynomial time computation, Inf. Comput, vol.183, issue.1, pp.57-85, 2003.

M. Gaboardi and S. R. Rocca, A soft type assignment system for lambda -calculus, CSL 2007, pp.253-267, 2007.

P. Baillot and K. Terui, 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

D. Mazza and K. Terui, Parsimonious types and non-uniform computation, ICALP 2015, Proceedings, Part II, pp.350-361, 2015.

D. Mazza, Simple parsimonious types and logarithmic space, CSL 2015, pp.24-40, 2015.

B. Accattoli and U. Dal-lago, Beta reduction is invariant, indeed, CSL-LICS '14, vol.8, pp.1-8, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091551

M. Gaboardi and R. Péchoux, 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

H. Férée, E. Hainry, M. Hoyrup, and R. Péchoux, Characterizing polynomial time complexity of stream programs using interpretations, TCS, vol.585, pp.41-54, 2015.

M. Gaboardi and R. Péchoux, Algebras and coalgebras in the light affine lambda calculus, ICFP 2015, pp.114-126, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01112165

U. Dal-lago, Infinitary lambda calculi from a linear perspective, LICS 2016, pp.447-456, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01400883

M. L. Campagnolo, The complexity of real recursive functions, UMC 2002, vol.2509, pp.1-14, 2002.

O. Bournez, W. Gomaa, and E. Hainry, 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

D. Leivant and R. Ramyaa, The Computational Contents of Ramified Corecurrence, pp.422-435, 2015.

U. Berger, From coinductive proofs to exact real arithmetic: theory and applications, Logical Methods in Computer Science, vol.7, issue.1, 2011.

U. Berger and M. Seisenberger, Proofs, programs, processes, Theory Comput. Syst, vol.51, issue.3, pp.313-329, 2012.

G. J. Chaitin, A theory of program size formally identical to information theory, Journal of the ACM, vol.22, issue.3, pp.329-340, 1975.

P. Baillot, 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

V. Atassi, P. Baillot, and K. Terui, 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.

J. Kennaway, J. W. Klop, M. R. Sleep, and F. J. De-vries, Infinitary lambda calculus, TCS, vol.175, issue.1, pp.93-125, 1997.