A Higher-Order Iterative Path Ordering

DOI10.1007/978-3-540-89439-1_48MaRDI QIDQ5505590zbMATH OpenOpenAlexFDO

Authors Cynthia Kop, Femke van Raamsdonk

Publication date 27 January 2009

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

Full work available at URL https://research.vu.nl/en/publications/f6510627-4428-41ff-8ade-35a82a8328e6

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Iterative Lexicographic Path Orders
• An improved general path order
• Certified Higher-Order Recursive Path Ordering
• On recursive path ordering
• Recursive Path Orderings Can Also Be Incremental
• Polymorphic higher-order recursive path orderings
• A Lambda-Free Higher-Order Recursive Path Order
• Improving associative path orderings
• scientific article; zbMATH DE number 3921960
• scientific article; zbMATH DE number 2090310

Cited in

(13)

• Improving associative path orderings
• The Computability Path Ordering: The End of a Quest
• Iterative Lexicographic Path Orders
• Recursive Path Orderings Can Also Be Incremental
• An improved general path order
• scientific article; zbMATH DE number 7379291 (Why is no real title available?)
• HORPO with Computability Closure: A Reconstruction
• Polymorphic higher-order recursive path orderings
• A Monotonic Higher-Order Semantic Path Ordering
• scientific article; zbMATH DE number 5585075 (Why is no real title available?)
• The recursive path and polynomial ordering for first-order and higher-order terms
• A Lambda-Free Higher-Order Recursive Path Order
• A Knuth-Bendix-like ordering for orienting combinator equations

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

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