A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Transfinite Knuth–Bendix Order for Lambda-Free Higher-Order Terms
[chapter]
2017
Lecture Notes in Computer Science
We generalize the Knuth-Bendix order (KBO) to higher-order terms without λ-abstraction. The restriction of this new order to first-order terms coincides with the traditional KBO. The order has many useful properties, including transitivity, the subterm property, compatibility with contexts (monotonicity), stability under substitution, and well-foundedness. Transfinite weights and argument coefficients can also be supported. The order appears promising as the basis of a higher-order superposition calculus.
doi:10.1007/978-3-319-63046-5_27
fatcat:t3y2q3czrrawzixu5ffoiyhbei