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

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

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

N. Avanzini, G. Eguchi, and . Moser, A new order-theoretic characterisation of the polytime computable functions, Theoretical Computer Science, vol.585, pp.3-24, 2015.
DOI : 10.1016/j.tcs.2015.03.003

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

G. Avanzini, M. Moser, and . Schaper, TcT: Tyrolean Complexity Tool, Proc. of 22 nd TACAS, 2016.
DOI : 10.1007/978-3-662-49674-9_24

URL : https://hal.archives-ouvertes.fr/hal-01392188

. Barendsen, Term Graph Rewriting, Term Rewriting Systems, pp.712-743, 2003.

B. Bonfante and . Guillaume, Non-simplifying Graph Rewriting Termination, Proc. of 7 th TERMGRAPH, EPTCS, pp.4-16, 2013.
DOI : 10.4204/EPTCS.110.3

URL : https://hal.archives-ouvertes.fr/hal-00921053

A. Bonfante, J. Cichon, H. Marion, and . Touzet, Algorithms with polynomial interpretation termination proof, Journal of Functional Programming, vol.11, issue.1, pp.33-53, 2001.
DOI : 10.1017/S0956796800003877

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

J. Bonfante, J. Marion, and . Moyen, Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, issue.25, pp.4122776-2796, 2011.
DOI : 10.1016/j.tcs.2011.02.007

URL : https://hal.archives-ouvertes.fr/hal-00591862

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

J. Sander-bruggink, B. König, and H. Zantema, Termination Analysis for Graph Transformation Systems, Proc. of 8 th IFIP TC 1/WG 2.2, TCS, pp.179-194, 2014.

J. S. Bruggink, B. König, D. Nolte, and H. Zantema, Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings, Proc. of 8 th ICGT, pp.52-68, 2015.
DOI : 10.1007/978-3-319-21145-9_4

. Dershowitz, Termination Dependencies, Proc. of 6 th WST, pp.28-30, 2003.

J. Frohn, J. Giesl, C. Hensel, T. Aschermann, and . Ströder, Inferring Lower Bounds for Runtime Complexity, Proc. of 26 th RTA, LIPIcs, pp.334-349, 2015.

T. Giesl, P. Ströder, F. Schneider-kamp, C. Emmes, and . Fuhs, Symbolic evaluation graphs and term rewriting, Proceedings of the 14th symposium on Principles and practice of declarative programming, PPDP '12, pp.1-12, 2012.
DOI : 10.1145/2370776.2370778

G. Gimenez and . Moser, The Complexity of Interaction, Proc. of 43 rd POPL, pp.243-255, 2016.

. Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.95-108, 1990.
DOI : 10.1145/96709.96718

G. Middeldorp, F. Moser, J. Neurauter, H. Waldmann, and . Zankl, Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems, Proc. of 4 th CAI, pp.1-20, 2011.
DOI : 10.1007/978-3-642-17511-4_27

. Moser, Proof Theory at Work: Complexity Analysis of Term Rewrite Systems. CoRR, abs/0907, 2009.

. Moser and . Kbos, KBOs, ordinals, subrecursive hierarchies and all that, Journal of Logic and Computation, vol.27, issue.2, 2014.
DOI : 10.1093/logcom/exu072

G. Moser and A. Schnabl, Proving Quadratic Derivational Complexities Using Context Dependent Interpretations, Proc. of 19 th RTA, pp.18-22, 2008.
DOI : 10.1007/978-3-540-70590-1_19

F. Noschinski, J. Emmes, and . 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

. Perrinel, On context semantics and interaction nets, 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.73, 2014.
DOI : 10.1145/2603088.2603155

URL : https://hal.archives-ouvertes.fr/hal-00992579

. Plump, Simplification orders for term graph rewriting, Proc. 22nd MFCS, pp.458-467, 1997.
DOI : 10.1007/BFb0029989

L. and P. Jones, The Implementation of Functional Languages, 1987.

. Schaper, A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems Master's thesis, 2014.

. Waldmann, Matrix Interpretations on Polyhedral Domains, Proc. of 26 th RTA, pp.318-333, 2015.

M. Zankl and . Korp, Modular Complexity Analysis for Term Rewriting, Logical Methods in Computer Science, vol.10, issue.1, pp.19-20, 2014.
DOI : 10.2168/LMCS-10(1:19)2014