First-Order Terms

Christian Sternagel 📧 and René Thiemann 🌐

February 6, 2018

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


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)


Session First_Order_Terms