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

@inproceedings{Becker2017ATK,
title={A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms},
author={Heiko Becker and Jasmin Christian Blanchette and Uwe Waldmann and Daniel Wand},
year={2017}
}
• Published in CADE 6 August 2017
• Mathematics
We generalize the Knuth–Bendix order (KBO) to higher-order terms without $$\lambda$$-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…
Formalization of the Embedding Path Order for Lambda-Free Higher-Order Terms
The embedding path order is a variant of the recursive path order for untyped λ-free higher-order terms that is a groundtotal and well-founded simplification order, making it more suitable for the superposition calculus.
A Knuth-Bendix-Like Ordering for Orienting Combinator Equations
• Mathematics
IJCAR
• 2020
A number of desirable properties about the KBO are proved including it having the subterm property for ground terms, being transitive and being well-founded, and the ordering fails to be a reduction ordering as it lacks compatibility with certain contexts.
Superposition for Lambda-Free Higher-Order Logic
• Computer Science
IJCAR
• 2018
Refutationally complete superposition calculi for intentional and extensional $$\lambda$$-free higher-order logic, two formalisms that allow partial application and applied variables, appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher- order logic.
Superposition for Lambda-Free Higher-Order Logic ( Technical Report )
• Computer Science
• 2018
Refutationally complete superposition calculi for intentional and extensional λ-free higher-order logic, two formalisms that allow partial application and applied variables, appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher- order logic.
Superposition with Lambdas
• Computer Science
• 2019
A superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans is designed and the results suggest that superposition is a suitable basis for higher- order reasoning.
Implementation of Lambda-Free Higher-Order Superposition
• Computer Science
• 2018
This thesis extends E, a state-of-the-art first-order ATP, to a fragment of HOL that is devoid of lambda abstractions (LFHOL), and devise generalizations of E’s indexing data structures to LFHOL, as well as algorithms like matching and unification to support HOL features in an efficient manner.
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
• Computer Science
TACAS
• 2019
This work proposes to start with the state-of-the-art superposition-based prover E and gradually enrich it with higher-order features, explaining how to extend the prover’s data structures, algorithms, and heuristics to $$\lambda$$-free higher- order logic, a formalism that supports partial application and applied variables.
Extending a brainiac prover to lambda-free higher-order logic
• Computer Science
Int. J. Softw. Tools Technol. Transf.
• 2022
This work proposes to start with the state-of-the-art superposition prover E and gradually enrich it with higher-order features, explaining how to extend the prover’s data structures, algorithms, and heuristics to higher- order logic, a formalism that supports partial application and applied variables.
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic
• Computer Science
FroCoS
• 2017
We describe a line of work that started in 2011 towards enriching Isabelle/HOL’s language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive
Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL
• Mathematics, Computer Science
FSCD
• 2017
Formal proofs of the main properties of the nested multiset order that are useful in applications are presented: preservation of well-foundedness and preservation of totality (linearity).

## References

SHOWING 1-10 OF 56 REFERENCES
Formalization of Knuth-Bendix Orders for Lambda-Free Higher-Order Terms
• Computer Science
Arch. Formal Proofs
• 2016
This Isabelle/HOL formalization of orders for higher-order terms without λ-abstraction proves many useful properties about them and appears promising as the basis of a higher- order superposition calculus.
A Lambda-Free Higher-Order Recursive Path Order
• Mathematics
FoSSaCS
• 2017
This new order fully coincides with the standard RPO on first-order terms also in the presence of currying, distinguishing it from previous work and appears promising as the basis of a higher-order superposition calculus.
Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms
• Computer Science
Arch. Formal Proofs
• 2016
This Isabelle/HOL formalization of recursive path orders (RPOs) for higher-order terms without λ-abstraction and proves many useful properties about them and appears promising as the basis of a higher- order superposition calculus.
On Transfinite Knuth-Bendix Orders
• Mathematics
• 2011
It is proved that any such order with finite subterm coefficients and for a finite signature is equivalent to an order using ordinals below ωω, that is, finite sequences of natural numbers of a fixed length.
An LPO-based Termination Ordering for Higher-Order Terms without lambda-abstraction
• Computer Science
TPHOLs
• 1998
A new precedence-based termination ordering for (polymorphic) higher-order terms without λ-abstraction is presented, which can be used to prove termination of many higher- order rewrite systems, especially those corresponding to typical functional programs.
A Higher-Order Iterative Path Ordering
• Computer Science
LPAR
• 2008
An iterative version of HORPO is presented by means of an auxiliary term rewriting system, following an approach originally due to Bergstra and Klop, and well-foundedness of the iterative definition is studied.
An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
• Computer Science
LPAR
• 2007
This work presents an extension of the Knuth-Bendix ordering that makes it possible to overcome certain requirements of hierarchic superposition calculi.
Polymorphic higher-order recursive path orderings
• Mathematics
JACM
• 2007
A family of recursive path orderings for terms of a typed lambda-calculus generated by a signature of polymorphic higher-order function symbols is defined, which can be generated from two given well-founded orderings, on the function symbols and on the type constructors.
Extensional Higher-Order Resolution
• Mathematics
• 1998
An extensional higher-order resolution calculus that is complete relative to Henkin model semantics is presented and the long-standing conjecture, that it is sufficient to restrict the order of primitive substitutions to the orders of input formulae is proved.
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion
• Computer Science
RTA
• 2013
Extensions of Isabelle Formalization of Rewriting are presented that cover two historically related concepts: the Knuth-Bendix order and the KnUTH-B Appendix completion procedure, and are able to certify completion proofs.