Tuple Interpretations for Higher-Order Complexity.

DOI10.4230/LIPICS.FSCD.2021.31arXiv2105.01112OpenAlexW3183406359MaRDI QIDQ6159947FDOQ6159947

Authors: Cynthia Kop, Deivid Vale 

Publication date: 23 June 2023

Abstract: We develop a class of algebraic interpretations for many-sorted and higher-order term rewriting systems that takes type information into account. Specifically, base-type terms are mapped to emph{tuples} of natural numbers and higher-order terms to functions between those tuples. Tuples may carry information relevant to the type; for instance, a term of type $mathsfnat$ may be associated to a pair $(mathsfcost,mathsfsize)$ representing its evaluation cost and size. This class of interpretations results in a more fine-grained notion of complexity than runtime or derivational complexity, which makes it particularly useful to obtain complexity bounds for higher-order rewriting systems. We show that rewriting systems compatible with tuple interpretations admit finite bounds on derivation height. Furthermore, we demonstrate how to mechanically construct tuple interpretations and how to orient $$ and $eta$ reductions within our technique. Finally, we relate our method to runtime complexity and prove that specific interpretation shapes imply certain runtime complexity bounds.

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

zbMATH Keywords

complexityhigher-order term rewritingpolynomial interpretationsweakly monotonic algebrasmany-sorted term rewriting

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx) Computer science (68-XX)

Cited In (5)

• Tuple interpretations for termination of term rewriting
• Term orderings for non-reachability of (conditional) rewriting
• Higher order interpretation for higher order complexity
• On basic feasible functionals and the interpretation method
• Analyzing Innermost Runtime Complexity Through Tuple Interpretations

This page was built for publication: Tuple Interpretations for Higher-Order Complexity.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159947)