Amortised Resource Analysis and Typed Polynomial Interpretations

DOI10.1007/978-3-319-08918-8_19zbMath1416.68093arXiv1402.1922OpenAlexW1506606726MaRDI QIDQ5170822

Georg Moser, Martin Hofmann

Publication date: 24 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.1922

zbMATH Keywords

typesterm rewritingpolynomial interpretationsamortised resource analysiscomplexity of rewriting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Related Items (5)

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ Lower bounds for runtime complexity of term rewriting ⋮ Unnamed Item ⋮ A new order-theoretic characterisation of the polytime computable functions ⋮ Type-based analysis of logarithmic amortised complexity

This page was built for publication: Amortised Resource Analysis and Typed Polynomial Interpretations