E. Albert, P. Arenas, S. Genaim, G. Puebla, and G. Román-díez, Conditional termination of loops over heap-allocated data, Science of Computer Programming, vol.92, pp.2-24, 2014.
DOI : 10.1016/j.scico.2013.04.006

D. Aspinall, L. Beringer, M. Hofmann, H. W. Loidl, and A. Momigliano, A program logic for resources, Theoretical Computer Science, vol.389, issue.3, pp.411-445, 2007.
DOI : 10.1016/j.tcs.2007.09.003

R. Atkey, Amortised Resource Analysis with Separation Logic, LMCS, vol.7, issue.2, 2011.

M. Avanzini, U. D. Lago, and G. Moser, Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order, Proc. 20th ICFP, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01231809

M. Avanzini and G. Moser, Tyrolean Complexity Tool: Features and Usage, Proc. of 24th RTA. LIPIcs, pp.71-80, 2013.

M. Avanzini and G. Moser, A combination framework for complexity, Information and Computation, vol.248, 2016.
DOI : 10.1016/j.ic.2015.12.007

M. Avanzini, C. Sternagel, and R. Thiemann, Certification of Complexity Proofs using CeTA, Proc. of 26th RTA. LIPIcs, pp.23-39, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01252000

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

R. Bird, Introduction to Functional Programming using Haskell, Second Edition, 1998.

M. Brockschmidt, F. Emmes, S. Falke, C. Fuhs, and J. Giesl, Alternating Runtime and Size Complexity Analysis of Integer Programs, Proc. 20th TACAS, pp.140-155, 2014.
DOI : 10.1007/978-3-642-54862-8_10

N. Danner, J. Paykin, and J. S. Royer, A static cost analysis for a higher-order language, Proceedings of the 7th workshop on Programming languages meets program verification, PLPV '13, pp.25-34, 2013.
DOI : 10.1145/2428116.2428123

S. Gimenez and G. Moser, The Complexity of Interaction, Proc. of 40th POPL, 2016.

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

J. Hoffmann, K. Aehlig, and M. Hofmann, Multivariate Amortized Resource Analysis, TOPLAS, vol.34, issue.3, p.14, 2012.

M. Hofmann and G. Moser, Multivariate Amortised Resource Analysis for Term Rewrite Systems, Proc. 13th TLCA, pp.241-256, 2015.

S. Jost, K. Hammond, H. W. Loidl, and M. Hofmann, Static Determination of Quantitative Resource Usage for Higher-order Programs, Proc. of 37th POPL, pp.223-236, 2010.

G. Klein, A machine-checked model for a Java-like language, virtual machine, and compiler, ACM Transactions on Programming Languages and Systems, vol.28, issue.4, pp.619-695, 2006.
DOI : 10.1145/1146809.1146811

D. Lankford, On Proving Term Rewriting Systems are Noetherian, 1979.

G. Moser, Proof Theory at Work: Complexity Analysis of Term Rewrite Systems, 2009.

G. Moser and M. Schaper, A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems. CoRR, cs/PL/1204, last revision, p.1568, 2012.

L. Noschinski, F. Emmes, and J. Giesl, Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs, Journal of Automated Reasoning, vol.19, issue.2, pp.27-56, 2013.
DOI : 10.1007/s10817-013-9277-6

P. M. Hill, E. Payet, and F. Spoto, Path-length Analysis of Object-Oriented Programs, Proc. 1st EAAI, 2006.

G. D. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-255, 1977.
DOI : 10.1016/0304-3975(77)90044-5

J. C. Reynolds, Definitional interpreters for higher-order programming languages, Proceedings of the ACM annual conference on , ACM '72, pp.363-397, 1998.
DOI : 10.1145/800194.805852

M. Sinn, F. Zuleger, and H. Veith, A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis, Proc. 26th CAV, pp.745-761, 2014.
DOI : 10.1007/978-3-319-08867-9_50

R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing et al., The worst-case execution-time problem???overview of methods and survey of tools, ACM Transactions on Embedded Computing Systems, vol.7, issue.3, pp.1-53, 2008.
DOI : 10.1145/1347375.1347389