A Monotonic Higher-Order Semantic Path Ordering

DOI10.1007/3-540-45653-8_37zbMath1275.68082OpenAlexW1604217182MaRDI QIDQ2996192

Albert Rubio, Cristina Borralleras

Publication date: 6 May 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45653-8_37

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Harnessing First Order Termination Provers Using Higher Order Dependency Pairs ⋮ Size-based termination of higher-order rewriting ⋮ Normal Higher-Order Termination ⋮ The Computability Path Ordering: The End of a Quest

Uses Software

• Automath