A Monotonic Higher-Order Semantic Path Ordering

DOI10.1007/3-540-45653-8_37MaRDI QIDQ2996192zbMATH OpenOpenAlexFDO

Authors Cristina Borralleras, Albert Rubio

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)

Recommendations

• scientific article; zbMATH DE number 1614707
• scientific article; zbMATH DE number 2043535
• A Higher-Order Iterative Path Ordering
• scientific article; zbMATH DE number 1405624
• Certified Higher-Order Recursive Path Ordering
• Polymorphic higher-order recursive path orderings
• scientific article; zbMATH DE number 3921960
• A generalization of ordered-pair semantics
• A Lambda-Free Higher-Order Recursive Path Order

Cited in

(10)

• scientific article; zbMATH DE number 1614707 (Why is no real title available?)
• Normal higher-order termination
• Harnessing first order termination provers using higher order dependency pairs
• The Computability Path Ordering: The End of a Quest
• scientific article; zbMATH DE number 2043535 (Why is no real title available?)
• Size-based termination of higher-order rewriting
• The recursive path and polynomial ordering for first-order and higher-order terms
• A termination ordering for higher order rewrite systems
• Weighted Path Orders Are Semantic Path Orders
• Wanda -- a higher-order termination tool (system description)

Describes a project that uses

Uses Software

• Automath

This page was built for publication: A Monotonic Higher-Order Semantic Path Ordering

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