|
2080
|
1 |
<!-- $Id$ -->
|
|
3279
|
2 |
<HTML><HEAD><TITLE>HOL/README</TITLE></HEAD><BODY>
|
|
1339
|
3 |
|
|
3279
|
4 |
<H2>HOL: Higher-Order Logic</H2>
|
|
1339
|
5 |
|
|
3279
|
6 |
This directory contains the ML sources of the Isabelle system for
|
|
|
7 |
Higher-Order Logic.<P>
|
|
1339
|
8 |
|
|
3279
|
9 |
There are several subdirectories with examples:
|
|
2080
|
10 |
<DL>
|
|
1339
|
11 |
<DT>ex
|
|
2080
|
12 |
<DD>general examples
|
|
|
13 |
|
|
|
14 |
<DT>Auth
|
|
|
15 |
<DD>a new approach to verifying authentication protocols
|
|
|
16 |
|
|
|
17 |
<DT>IMP
|
|
|
18 |
<DD>mechanization of a large part of a semantics text by Glynn Winskel
|
|
|
19 |
|
|
3125
|
20 |
<DT>Induct
|
|
|
21 |
<DD>examples of (co)inductive definitions
|
|
|
22 |
|
|
2080
|
23 |
<DT>Integ
|
|
|
24 |
<DD>a theory of the integers including efficient integer calculations
|
|
|
25 |
|
|
|
26 |
<DT>IOA
|
|
3125
|
27 |
<DD>extended example of Input/Output Automata
|
|
2080
|
28 |
|
|
|
29 |
<DT>Lambda
|
|
|
30 |
<DD>a proof of the Church-Rosser theorem for lambda-calculus
|
|
1339
|
31 |
|
|
|
32 |
<DT>Subst
|
|
|
33 |
<DD>subdirectory defining a theory of substitution and unification.
|
|
|
34 |
</DL>
|
|
|
35 |
|
|
|
36 |
Useful references on Higher-Order Logic:
|
|
|
37 |
|
|
|
38 |
<UL>
|
|
1341
|
39 |
<LI>P. B. Andrews,<BR>
|
|
|
40 |
An Introduction to Mathematical Logic and Type Theory<BR>
|
|
|
41 |
(Academic Press, 1986).
|
|
1339
|
42 |
|
|
1341
|
43 |
<LI>J. Lambek and P. J. Scott,<BR>
|
|
|
44 |
Introduction to Higher Order Categorical Logic (CUP, 1986)
|
|
1339
|
45 |
</UL>
|
|
|
46 |
|
|
|
47 |
</BODY></HTML>
|