A Monotonic Higher-Order Semantic Path Ordering
From MaRDI portal
Publication:2996192
DOI10.1007/3-540-45653-8_37zbMATH Open1275.68082OpenAlexW1604217182MaRDI QIDQ2996192FDOQ2996192
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
Recommendations
- scientific article; zbMATH DE number 1614707
- scientific article; zbMATH DE number 2043535
- A Higher-Order Iterative Path Ordering
- Publication:4938603
- 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 (9)
- Harnessing first order termination provers using higher order dependency pairs
- The Computability Path Ordering: The End of a Quest
- Normal higher-order termination
- Size-based termination of higher-order rewriting
- Title not available (Why is that?)
- A termination ordering for higher order rewrite systems
- The recursive path and polynomial ordering for first-order and higher-order terms
- Weighted Path Orders Are Semantic Path Orders
- Title not available (Why is that?)
Uses Software
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)
