Tuple Interpretations and Applications to Higher-Order Runtime Complexity
Logic in Computer Science
2022-07-01 v1 Symbolic Computation
Abstract
Tuple interpretations are a class of algebraic interpretation that subsumes both polynomial and matrix interpretations as it does not impose simple termination and allows non-linear interpretations. It was developed in the context of higher-order rewriting to study derivational complexity of algebraic functional systems. In this short paper, we continue our journey to study the complexity of higher-order TRSs by tailoring tuple interpretations to deal with innermost runtime complexity.
Cite
@article{arxiv.2206.15202,
title = {Tuple Interpretations and Applications to Higher-Order Runtime Complexity},
author = {Cynthia Kop and Deivid Vale},
journal= {arXiv preprint arXiv:2206.15202},
year = {2022}
}