HOL: Higher-Order Logic with curried functions
This directory contains the Standard ML sources of the Isabelle system for
Higher-Order Logic with curried functions. Important files include
- ROOT.ML
- loads all source files. Enter an ML image containing Pure
Isabelle and type: use "ROOT.ML";
- Makefile
- compiles the files under Poly/ML or SML of New Jersey
There are several subdirectories. To execute them, issue the command
use_dir "<DIR>";
where <DIR> is the desired directory
- ex
- general examples
- Auth
- a new approach to verifying authentication protocols
- IMP
- mechanization of a large part of a semantics text by Glynn Winskel
- Integ
- a theory of the integers including efficient integer calculations
- IOA
- extended example of Input/Output Automata (takes a long time to run!)
- 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).
- J. Lambek and P. J. Scott,
Introduction to Higher Order Categorical Logic (CUP, 1986)