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

Title:	Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms
Authors:	Jasmin Christian Blanchette (j /dot/ c /dot/ blanchette /at/ vu /dot/ nl), Uwe Waldmann (uwe /at/ mpi-inf /dot/ mpg /dot/ de) and Daniel Wand (dwand /at/ mpi-inf /dot/ mpg /dot/ de)
Submission date:	2016-09-23
Abstract:	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.
BibTeX:	@article{Lambda_Free_RPOs-AFP, author = {Jasmin Christian Blanchette and Uwe Waldmann and Daniel Wand}, title = {Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms}, journal = {Archive of Formal Proofs}, month = sep, year = 2016, note = {\url{http://isa-afp.org/entries/Lambda_Free_RPOs.html}, Formal proof development}, ISSN = {2150-914x}, }
License:	BSD License
Depends on:	Nested_Multisets_Ordinals
Used by:	Functional_Ordered_Resolution_Prover, Higher_Order_Terms, Lambda_Free_EPO, Lambda_Free_KBOs, Saturation_Framework
Status: [ok]	This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.