U. Accattoli and . Dal-lago, On the Invariance of the Unitary Cost Model for Head Reduction, Proc. of 23 rd RTA, pp.22-37, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00780349

U. Accattoli and . Dal-lago, Beta reduction is invariant, indeed, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, p.8, 2014.
DOI : 10.1145/2603088.2603105
URL : https://hal.archives-ouvertes.fr/hal-01091551

N. Arai and . Eguchi, A new function algebra of EXPTIME functions by safe nested recursion, ACM Transactions on Computational Logic, vol.10, issue.4, 2009.
DOI : 10.1145/1555746.1555748

U. Avanzini and . Dal-lago, On Sharing, Memoization, and Polynomial Time, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01231816

G. Avanzini and . Moser, Closing the Gap Between Runtime Complexity and Polytime Computability, Proc. of 21 st RTA, pp.33-48, 2010.

T. Baader and . Nipkow, Term Rewriting and All That, 1998.

U. Baillot, J. Lago, and . Moyen, On quasi-interpretations, blind abstractions and implicit complexity, Mathematical Structures in Computer Science, vol.2244, issue.04, pp.549-580, 2012.
DOI : 10.1016/0304-3975(82)90026-3
URL : https://hal.archives-ouvertes.fr/hal-00798377

. Bellantoni, Predicative Recursion and Computational Complexity, 1992.

. Bellantoni, Predicative Recursion and The Polytime Hierarchy, Feasible Mathematics II. Birkhäuser Boston, 1994.
DOI : 10.1007/978-1-4612-2566-9_2

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

R. Bonfante, J. Kahle, I. Marion, and . Oitavem, Recursion Schemata for NCk, Proc. of 22 nd CSL, pp.49-63, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00342366

J. Bonfante, J. Marion, and . Moyen, Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, issue.25, pp.2776-2796, 2011.
DOI : 10.1016/j.tcs.2011.02.007
URL : https://hal.archives-ouvertes.fr/hal-00591862

D. Lago and S. Martini, Derivational Complexity is an Invariant Cost Model, Revised Selected Papers of 1 st FOPARA, pp.100-113, 2009.

D. Lago and S. Martini, On Constructor Rewrite Systems and the Lambda Calculus, LMCS, vol.8, issue.3, pp.1-27, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00909372

D. Lago, S. Martini, and M. Zorzi, General Ramified Recurrence is Sound for Polynomial Time, Proc. of 1 st DICE, pp.47-62, 2010.
DOI : 10.4204/EPTCS.23.4

J. S. Danner and . Royer, Ramified Structural Recursion and Corecursion. CoRR, abs/1201, 2012.

G. Hirokawa and . Moser, Automated Complexity Analysis Based on the Dependency Pair Method, Proc. of 4 th IJCAR, pp.364-380, 2008.
DOI : 10.1007/978-3-540-71070-7_32

. Hoffmann, Term rewriting with sharing and memo??zation, Proc. of 3 rd ALP, pp.128-142, 1992.
DOI : 10.1007/BFb0013824

. Leivant, Stratified functional programs and computational complexity, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.325-333, 1993.
DOI : 10.1145/158511.158659