Tuple Interpretations for Higher-Order Complexity.

DOI10.4230/lipics.fscd.2021.31arXiv2105.01112OpenAlexW3183406359MaRDI QIDQ6159947

Cynthia Kop, Deivid Vale

Publication date: 23 June 2023

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)

Related Items (3)

Analyzing Innermost Runtime Complexity Through Tuple Interpretations ⋮ Tuple interpretations for termination of term rewriting ⋮ Term orderings for non-reachability of (conditional) rewriting

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