Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms (Q7361192)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Lambda_Free_RPOs
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms |
AFP entry Lambda_Free_RPOs |
Statements
23 September 2016
0 references
Jasmin Christian Blanchette
0 references
Uwe Waldmann
0 references
Daniel Wand
0 references
Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms (English)
0 references
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.
0 references
