• Corpus ID: 221312116

Isabelle/HOL: A Proof Assistant for Higher-Order Logic

@inproceedings{Nipkow2002IsabelleHOLAP,
  title={Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
  author={Tobias Nipkow and Markus Wenzel and Lawrence Charles Paulson},
  year={2002}
}
Elementary Techniques.- 1. The Basics.- 2. Functional Programming in HOL.- 3. More Functional Programming.- 4. Presenting Theories.- Logic and Sets.- 5. The Rules of the Game.- 6. Sets, Functions, and Relations.- 7. Inductively Defined Sets.- Advanced Material.- 8. More about Types.- 9. Advanced Simplification, Recursion, and Induction.- 10. Case Study: Verifying a Security Protocol. 

Theorema-HOL: Classical Higher-Order Logic in Theorema

Theorema-HOL, an add-on package for the Theorema 2.0 proof assistant which enables users to formalize their mathematical theories in classical higher-order logic, comes with an intuitive and easy-to-use theoryand proof language, inspired by Isabelle/Isar, for proving theorems interactively.

Towards a Verified Prover for a Ground Fragment of Set Theory

Using Isabelle/HOL, the syntax and semantics of MLSS are formalised as well as a sound and complete tableau calculus for it and an abstract specification of a decision procedure that applies the rules of the calculus exhaustively and proves its termination.

Automatic proofs and refutations for higher-order logic

Nitpick is the development of Nitpick, a counterexample generator that builds on a first-order relational model finder that heuristically selects facts relevant to the conjecture to prove and delegates the problem to first- order resolution provers and SMT solvers.

Meta-Logical Reasoning in Higher-Order Logic

The semantics of FOL can be described in the meta-language of higher-order logic (HOL) and one can prove sentences in FOL valid using the formalized FOL semantics.

A Short Mechanized Proof of the Church-Rosser Theorem by the Z-property for the $\lambda\beta$-calculus in Nominal Isabelle

We present a short proof of the Church-Rosser property for the lambda-calculus enjoying two distinguishing features: firstly, it employs the Z-property, resulting in a short and elegant proof; and

Going Polymorphic - TH1 Reasoning for Leo-III

Modifications to the higher-order automated theorem prover Leo-III are presented for turning it into a reasoning system for rank-1 polymorphic HOL and a suitable paramodulation-based calculus are sketched.

A Simple Semi-automated Proof Assistant for First-order Modal Logics

The aim of this paper is to encourage the development of personal proof assistants and semi-automated provers for a variety of modal logics.

Certified Soundness of Simplest Known Formulation of First-Order Logic

This work shows work in progress on certifying soundness of this system in the interactive proof assistant Isabelle, and establishes an outline for future work such as a certified completeness proof of the axiomatic system in Isabelle.

Adapting functional programs to higher order logic

Techniques that support the expression of functional programs as logical functions are discussed, including those that can be automatically proved and those that have difficult termination proofs.

Isabelle's Metalogic: Formalization and Proof Checker

This work formalizes this metalogic and the language of proof terms in Isabelle/HOL, defines an executable (but inefficient) proof term checker and proves the correctness of all the proofs in those theories.
...