Abstract

We study amortised resource analysis in the context of term rewrite systems. We introduce a novel amortised analysis based on the potential method. The method is represented in an inference system akin to a type system and gives rise to polynomial bounds on the innermost runtime complexity of the analysed rewrite system. The crucial feature of the inference system is the admittance of multivariate bounds in the context of arbitrary data structures in a completely uniform way. This extends our earlier univariate resource analysis of typed term rewrite systems and continues our program of applying automated amortised resource analysis to rewriting.

BibTeX

@inproceedings{MHGM15,
  author    = "Martin Hofmann and Georg Moser",
  title     = "Multivariate Amortised Resource Analysis for Term Rewrite
               Systems",
  booktitle = "Proceedings of the 13th International Conference on
               Typed Lambda Calculi and Applications (TLCA 2015)",
  editor    = "Thorsten Altenkirch",
  series    = "Leibniz International Proceedings in Informatics",
  volume    = 38,
  pages     = "241--256",
  year      = 2015,
  doi       = "10.4230/LIPIcs.TLCA.2015.241"
}