Abstract

We formalize basic results on first-order terms, including 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.

BibTeX

@article{CSRT-AFP18,
  author  = {Christian Sternagel and René Thiemann},
  title   = {First-Order Terms},
  journal = {Archive of Formal Proofs},
  month   = feb,
  year    = 2018,
  note    = {\url{https://www.isa-afp.org/entries/First_Order_Terms.html},
            Formal proof development},
  ISSN    = {2150-914x},
}