A Lambda-Free Higher-Order Recursive Path Order

Abstract

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

Cite this paper

@inproceedings{Blanchette2017ALH, title={A Lambda-Free Higher-Order Recursive Path Order}, author={Jasmin Christian Blanchette and Uwe Waldmann and Daniel Wand}, booktitle={FoSSaCS}, year={2017} }