Amortised Resource Analysis and Typed Polynomial Interpretations (extended version)
Abstract
We introduce a novel resource analysis for typed term rewrite systems based on a potentialbased type system. This type system gives rise to polynomial bounds on the innermost runtime complexity. We relate the thus obtained amortised resource analysis to polynomial interpretations and obtain the perhaps surprising result that whenever a rewrite system R can be welltyped, then there exists a polynomial interpretation that orients R. For this we adequately adapt the standard notion of polynomial interpretations to the typed setting.
 Publication:

arXiv eprints
 Pub Date:
 February 2014
 arXiv:
 arXiv:1402.1922
 Bibcode:
 2014arXiv1402.1922H
 Keywords:

 Computer Science  Logic in Computer Science;
 Computer Science  Programming Languages
 EPrint:
 25 pages