HOL: Higher-Order Logic
This directory contains the ML sources of the Isabelle system for
Higher-Order Logic.
There are several subdirectories with examples:
- ex
- general examples
- Auth
- a new approach to verifying authentication protocols
- IMP
- mechanization of a large part of a semantics text by Glynn Winskel
- Induct
- examples of (co)inductive definitions
- Integ
- a theory of the integers including efficient integer calculations
- IOA
- extended example of Input/Output Automata
- Lambda
- a proof of the Church-Rosser theorem for lambda-calculus
- Subst
- subdirectory defining a theory of substitution and unification.
Useful references on Higher-Order Logic:
- P. B. Andrews,
An Introduction to Mathematical Logic and Type Theory
(Academic Press, 1986).
- A. Church,
A Formulation of the Simple Theory of Types
(Journal of Symbolic Logic, 1940).
- M. J. C. Gordon and T. F. Melham (editors),
Introduction to HOL: A theorem proving environment for higher order logic
(Cambridge University Press, 1993).
- J. Lambek and P. J. Scott,
Introduction to Higher Order Categorical Logic
(Cambridge University Press, 1986).