A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Lambda-Free Higher-Order Recursive Path Order
[chapter]
2017
Lecture Notes in Computer Science
We generalize the recursive path order (RPO) to higher-order terms without λ-abstraction. This new order fully coincides with the standard RPO on first-order terms also in the presence of currying, distinguishing it from previous work. It has many useful properties, including well-foundedness, transitivity, stability under substitution, and the subterm property. It appears promising as the basis of a higher-order superposition calculus.
doi:10.1007/978-3-662-54458-7_27
fatcat:tyswf6bl3japhgppwbknvg546u