HOL: Higher-Order Logic
These are the main sources of the Isabelle system for Higher-Order Logic.
There are also several example sessions:
- rings and univariate polynomials
- a new approach to verifying authentication protocols
- a few basic examples of using axiomatic type classes
- a development of the complex numbers, the reals, and the hyper-reals,
which are used in non-standard analysis (builds the image HOL-Complex)
- verification of imperative programs (verification conditions are
generated automatically from pre/post conditions and loop invariants)
- verification of shared-variable imperative programs a la Owicki-Gries.
(verification conditions are generated automatically)
- Nonstandard analysis. Builds on Real and is part of Complex.
- mechanization of a large part of a semantics text by Glynn Winskel
- extension of IMP with local variables and mutually recursive
- theories imported from other (HOL) theorem provers.
- examples of (co)inductive definitions
- a simple theory of Input/Output Automata
- several introductory examples using Isabelle/Isar
- fundamental properties of lambda-calculus (Church-Rosser and termination)
- lattices and order structures (in Isabelle/Isar)
- A collection of generic theories
- two-dimensional matrices
- formalization of a fragment of Java, together with a corresponding
virtual machine and a specification of its bytecode verifier and a
lightweight bytecode verifier, including proofs of type-safety
- basic setup for integration of some model checkers in Isabelle/HOL
- Haore Logic for a tiny fragment of Java
- fundamental Theorem of Arithmetic, Chinese Remainder Theorem,
Fermat/Euler Theorem, Wilson's Theorem, Quadratic Reciprocity
- a (bare-bones) implementation of Lambda-Prolog
- the real numbers, part of Complex
- the Hahn-Banach theorem for real vector spaces (in Isabelle/Isar)
- verification of the SET Protocol
- a theory of substitution and unification.
- Lamport's Temporal Logic of Actions (with separate example sessions)
- Chandy and Misra's UNITY formalism
- a precursor of MiniML, without let-expressions
- miscellaneous examples