• Corpus ID: 30664862

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

@article{Blanchette2016FormalizationOR,
title={Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms},
author={Jasmin Christian Blanchette and Uwe Waldmann and Daniel Wand},
journal={Arch. Formal Proofs},
year={2016},
volume={2016}
}
• Published 2016
• Computer Science
• Arch. Formal Proofs
This Isabelle/HOL formalization de nes recursive path orders (RPOs) for higher-order terms without λ-abstraction and proves many useful properties about them. The main order fully coincides with the standard RPO on rst-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.
5 Citations
A Lambda-Free Higher-Order Recursive Path Order
• Mathematics
FoSSaCS
• 2017
This new order fully coincides with the standard RPO on first-order terms also in the presence of currying, distinguishing it from previous work and appears promising as the basis of a higher-order superposition calculus.
A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms
• Mathematics
The Knuth–Bendix order is generalized to higher-order terms without $$\lambda$$-abstraction and appears promising as the basis of a higher- order superposition calculus.