• Corpus ID: 30664862

Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms

@article{Blanchette2016FormalizationOR,
  title={Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms},
  author={Jasmin Christian Blanchette and Uwe Waldmann and Daniel Wand},
  journal={Arch. Formal Proofs},
  year={2016},
  volume={2016}
}
This Isabelle/HOL formalization de nes recursive path orders (RPOs) for higher-order terms without λ-abstraction and proves many useful properties about them. The main order fully coincides with the standard RPO on rst-order terms also in the presence of currying, distinguishing it from previous work. An optimized variant is formalized as well. It appears promising as the basis of a higher-order superposition calculus. 
A Lambda-Free Higher-Order Recursive Path Order
TLDR
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.
A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms
TLDR
The Knuth–Bendix order is generalized to higher-order terms without \(\lambda \)-abstraction and appears promising as the basis of a higher- order superposition calculus.
An Algebra for Higher-Order Terms
TLDR
In this formalization, a higher-order term algebra is introduced, generalizing the notions of free variables, matching, and substitution, and implement translation functions between de-Bruijn terms and named terms and prove their correctness.
Formalization of the Resolution Calculus for First-Order Logic
TLDR
A formalization in Isabelle/HOL of the resolution calculus for first-order logic with formal soundness and completeness proofs and a thorough overview of formalizations of first- order logic found in the literature is given.
Formalization of Logic in the Isabelle Proof Assistant
TLDR
This thesis describes formalizations in Isabelle of several logics as well as tools built upon these, including the Natural Deduction Assistant (NaDeA), which is a tool for teaching first-order logic that allows users to build proofs in natural deduction.