Abstract
We formalize basic results on first-order terms, including matching and a
first-order unification algorithm, as well as well-foundedness of the
subsumption order. This entry is part of the Isabelle
Formalization of Rewriting IsaFoR,
where first-order terms are omni-present: the unification algorithm is
used to certify several confluence and termination techniques, like
critical-pair computation and dependency graph approximations; and the
subsumption order is a crucial ingredient for completion.
GNU Lesser General Public License (LGPL)Depends On
Used by
- Saturation_Framework_Extensions
- Knuth_Bendix_Order
- Stateful_Protocol_Composition_and_Typing
- Functional_Ordered_Resolution_Prover
- Resolution_FOL