Lambda Free RPOs
Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms. 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.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Schlichtkrull, Anders: Formalization of the resolution calculus for first-order logic (2018)
- Blanchette, Jasmin Christian; Fleury, Mathias; Traytel, Dmitriy: Nested multisets, hereditary multisets, and syntactic ordinals in Isabelle/HOL (2017)
- Blanchette, Jasmin Christian; Waldmann, Uwe; Wand, Daniel: A lambda-free higher-order recursive path order (2017)