R. M. Amadio, Synthesis of max-plus quasi-interpretations, Fundamenta Informaticae, vol.65, issue.1, pp.29-60, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00146968

S. Bellantoni and S. A. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992.
DOI : 10.1007/BF01201998

G. Bonfante, J. Y. Marion, and J. Y. Moyen, Quasi-interpretations, Theor. Comput. Sci.. to appear
URL : https://hal.archives-ouvertes.fr/inria-00000660

A. Cobham, The Intrinsic Computational Difficulty of Functions In: Logic, methodology and philosophy of science III, p.24, 1965.

R. L. Constable, Type two computational complexity, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.108-121, 1973.
DOI : 10.1145/800125.804041

J. Endrullis, C. Grabmayer, D. Hendriks, A. Isihara, and J. W. Klop, Productivity of stream definitions, Theor. Comput. Sci, vol.411, pp.4-5, 2010.

M. Gaboardi and R. Péchoux, Upper Bounds on Stream I/O Using Semantic Interpretations, In: Computer Science Logic, vol.17, issue.3, pp.271-286, 2009.
DOI : 10.1016/0304-3975(82)90026-3

URL : https://hal.archives-ouvertes.fr/inria-00431469

R. J. Irwin, J. S. Royer, and B. M. Kapron, On characterizations of the basic feasible functionals, Part I, Journal of Functional Programming, vol.11, issue.1, pp.117-153, 2001.
DOI : 10.1017/S0956796800003841

B. M. Kapron and S. A. Cook, A new Characterization of Type-2 Feasibility, SIAM Journal on Computing, vol.25, issue.1, pp.117-132, 1996.
DOI : 10.1137/S0097539794263452

K. I. Ko, Complexity theory of real functions, 1991.
DOI : 10.1007/978-1-4684-6802-1

D. Lankford, On proving term rewriting systems are noetherien. tech. rep, 1979.

D. Leivant and J. Y. Marion, Lambda calculus characterizations of poly-time, Typed Lambda Calculi and Applications, pp.274-288, 1993.
DOI : 10.1007/BFb0037112

Z. Manna and S. Ness, On the termination of Markov algorithms, Third Hawaii international conference on system science, pp.789-792, 1970.

K. Mehlhorn, Polynomial and abstract subrecursive classes, Proceedings of the sixth annual ACM symposium on Theory of computing, pp.96-109, 1974.

R. Ramyaa and D. Leivant, Feasible Functions over Co-inductive Data, In: WoLLIC, pp.191-203, 2010.
DOI : 10.1007/978-3-642-13824-9_16

A. Seth, Turing Machine Characterizations of Feasible Functionals of All Finite Types, Feasible Mathematics II, pp.407-428, 1995.
DOI : 10.1007/978-1-4612-2566-9_14

K. Weihrauch, Computable analysis: an introduction, 2000.