Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms

Jasmin Christian Blanchette 📧, Uwe Waldmann 📧 and Daniel Wand 📧

September 23, 2016

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This Isabelle/HOL formalization defines recursive path orders (RPOs) for higher-order terms without lambda-abstraction and proves many useful properties about them. The main order fully coincides with the standard RPO on first-order terms also in the presence of currying, distinguishing it from previous work. An optimized variant is formalized as well. It appears promising as the basis of a higher-order superposition calculus.


BSD License


Session Lambda_Free_RPOs