A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2017

A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms

Résumé

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.
Fichier principal
Vignette du fichier
BeckerBlanchetteWaldmannWandCADE.pdf (211.73 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01592186 , version 1 (27-09-2017)

Identifiants

Citer

Heiko Becker, Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand. A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms. CADE-26 - 26th International Conference on Automated Deduction, Aug 2017, Gothenburg, Sweden. pp.432-453, ⟨10.1007/978-3-319-63046-5_27⟩. ⟨hal-01592186⟩
185 Consultations
290 Téléchargements

Altmetric

Partager

More