论文标题
元组解释和应用程序的应用程序复杂性
Tuple Interpretations and Applications to Higher-Order Runtime Complexity
论文作者
论文摘要
元组解释是一类代数解释，它既包含多项式和基质解释，因为它不施加简单的终止并允许非线性解释。它是在高阶重写的背景下开发的，以研究代数功能系统的衍生性复杂性。在这篇简短的论文中，我们通过调整元组解释来应对最终的运行时复杂性，继续研究高阶TRS的复杂性。
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.
