|
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 |
|
|
7291
|
17 |
<DT>Hoare
|
|
|
18 |
<DD>verification of imperative programs; verification conditions are
|
|
|
19 |
generated automatically from pre/post conditions and loop invariants.
|
|
|
20 |
|
|
2080
|
21 |
<DT>IMP
|
|
|
22 |
<DD>mechanization of a large part of a semantics text by Glynn Winskel
|
|
|
23 |
|
|
3125
|
24 |
<DT>Induct
|
|
|
25 |
<DD>examples of (co)inductive definitions
|
|
|
26 |
|
|
7290
|
27 |
<DT>Integ
|
|
|
28 |
<DD>a development of the integers including efficient integer
|
|
|
29 |
calculations (part of the standard HOL environment)
|
|
2080
|
30 |
|
|
|
31 |
<DT>IOA
|
|
7291
|
32 |
<DD>a simple theory of Input/Output Automata
|
|
2080
|
33 |
|
|
|
34 |
<DT>Lambda
|
|
|
35 |
<DD>a proof of the Church-Rosser theorem for lambda-calculus
|
|
1339
|
36 |
|
|
7291
|
37 |
<DT>Lex
|
|
|
38 |
<DD>verification of a simple lexical analyzer generator
|
|
|
39 |
|
|
|
40 |
<DT>MiniML
|
|
|
41 |
<DD>formalization of type inference for the language Mini-ML
|
|
|
42 |
|
|
7290
|
43 |
<DT>Real
|
|
|
44 |
<DD>a development of the reals and hyper-reals, which are used in
|
|
|
45 |
non-standard analysis. Also includes the positive rationals. Used to build
|
|
|
46 |
the image HOL-Real.
|
|
|
47 |
|
|
1339
|
48 |
<DT>Subst
|
|
7290
|
49 |
<DD>defines a theory of substitution and unification.
|
|
|
50 |
|
|
7291
|
51 |
<DT>TLA
|
|
|
52 |
<DD>Lamport's Temporal Logic of Actions
|
|
|
53 |
|
|
7290
|
54 |
<DT>Tools
|
|
|
55 |
<DD>holds code used to provide support for records, datatypes, induction, etc.
|
|
|
56 |
|
|
|
57 |
<DT>UNITY
|
|
|
58 |
<DD>Chandy and Misra's UNITY formalism.
|
|
7291
|
59 |
|
|
|
60 |
<DT>W0
|
|
|
61 |
<DD>a precursor of MiniML, without let-expressions
|
|
1339
|
62 |
</DL>
|
|
|
63 |
|
|
|
64 |
Useful references on Higher-Order Logic:
|
|
|
65 |
|
|
|
66 |
<UL>
|
|
4622
|
67 |
|
|
|
68 |
<LI> P. B. Andrews,<BR>
|
|
1341
|
69 |
An Introduction to Mathematical Logic and Type Theory<BR>
|
|
|
70 |
(Academic Press, 1986).
|
|
1339
|
71 |
|
|
4622
|
72 |
<P>
|
|
|
73 |
|
|
|
74 |
<LI> A. Church,<BR>
|
|
|
75 |
A Formulation of the Simple Theory of Types<BR>
|
|
|
76 |
(Journal of Symbolic Logic, 1940).
|
|
|
77 |
|
|
|
78 |
<P>
|
|
|
79 |
|
|
|
80 |
<LI> M. J. C. Gordon and T. F. Melham (editors),<BR>
|
|
|
81 |
Introduction to HOL: A theorem proving environment for higher order logic<BR>
|
|
|
82 |
(Cambridge University Press, 1993).
|
|
|
83 |
|
|
|
84 |
<P>
|
|
|
85 |
|
|
|
86 |
<LI> J. Lambek and P. J. Scott,<BR>
|
|
|
87 |
Introduction to Higher Order Categorical Logic<BR>
|
|
|
88 |
(Cambridge University Press, 1986).
|
|
|
89 |
|
|
1339
|
90 |
</UL>
|
|
|
91 |
|
|
|
92 |
</BODY></HTML>
|