Polynomial Interpretations for Higher-Order Rewriting

DOI10.4230/LIPIcs.RTA.2012.176zbMath1437.68080arXiv1203.5754OpenAlexW2241047399MaRDI QIDQ5111904

Cynthia Kop, Carsten Fuhs

Publication date: 27 May 2020

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

zbMATH Keywords

terminationhigher-order rewritingautomationpolynomial interpretationsweakly monotonic algebras

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (5)

Higher-order interpretations and program complexity ⋮ Unnamed Item ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Polynomial Interpretations for Higher-Order Rewriting