A Higher-Order Iterative Path Ordering

DOI10.1007/978-3-540-89439-1_48zbMATH Open1182.68096OpenAlexW1546804799MaRDI QIDQ5505590FDOQ5505590

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

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

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
• Title not available (Why is that?)
• HORPO with Computability Closure: A Reconstruction
• Polymorphic higher-order recursive path orderings
• A Monotonic Higher-Order Semantic Path Ordering
• Title not available (Why is that?)
• 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)