|
5790
|
1 |
<html>
|
|
|
2 |
|
|
|
3 |
<head>
|
|
5794
|
4 |
<!-- $Id$ -->
|
|
5790
|
5 |
<title>Isabelle</title>
|
|
5795
|
6 |
</head>
|
|
5790
|
7 |
|
|
|
8 |
<body>
|
|
|
9 |
|
|
|
10 |
<h1>Isabelle </h1> <a href="http://www.in.tum.de/~isabelle/logo/"><img
|
|
|
11 |
src="isabelle.gif" width=100 align=right alt="[Isabelle logo]"></a>
|
|
|
12 |
|
|
|
13 |
<p>
|
|
|
14 |
|
|
|
15 |
<strong>Isabelle</strong> is a popular generic theorem proving
|
|
|
16 |
environment developed at Cambridge University (<a
|
|
|
17 |
href="http://www.cl.cam.ac.uk/users/lcp/">Larry Paulson</a>) and TU
|
|
|
18 |
Munich (<a href="http://www.in.tum.de/~nipkow/">Tobias Nipkow</a>).
|
|
|
19 |
|
|
|
20 |
<p>
|
|
5805
|
21 |
|
|
|
22 |
<a
|
|
|
23 |
href="http://www.cl.cam.ac.uk/Research/HVG/Isabelle/cambridge.html"><img
|
|
5803
|
24 |
src="cambridge.gif" width=145 border=0 align=right
|
|
|
25 |
alt="[Cambridge]"></a> <a
|
|
|
26 |
href="http://www.in.tum.de/~isabelle/munich.html"><img
|
|
5805
|
27 |
src="munich.gif" width=48 border=0 align=right alt="[Munich]"></a>
|
|
|
28 |
This page provides general information on Isabelle, more details are
|
|
|
29 |
available on the local Isabelle pages at <a
|
|
5803
|
30 |
href="http://www.cl.cam.ac.uk/Research/HVG/Isabelle/cambridge.html">Cambridge</a>
|
|
5805
|
31 |
and <a href="http://www.in.tum.de/~isabelle/munich.html">Munich</a>.
|
|
|
32 |
See there for informations on projects done with Isabelle, mailing
|
|
|
33 |
list archives, research papers, the Isabelle bibliography, and
|
|
|
34 |
Isabelle workshops and courses.
|
|
5803
|
35 |
|
|
|
36 |
|
|
|
37 |
|
|
|
38 |
<h2>Obtaining Isabelle</h2>
|
|
|
39 |
The latest version is <strong>Isabelle98-1</strong>, it is available
|
|
5805
|
40 |
from several
|
|
|
41 |
<a href="dist/">mirror sites</a>.
|
|
5803
|
42 |
|
|
|
43 |
|
|
|
44 |
|
|
|
45 |
<h2>What is Isabelle?</h2>
|
|
5790
|
46 |
Isabelle can be viewed from two main perspectives. On the one hand it
|
|
|
47 |
may serve as a generic framework for rapid prototyping of deductive
|
|
5803
|
48 |
systems. On the other hand, major existing logics like
|
|
5791
|
49 |
<strong>Isabelle/HOL</strong> provide a theorem proving environment
|
|
5790
|
50 |
ready to use for sizable applications.
|
|
|
51 |
|
|
|
52 |
|
|
5803
|
53 |
<h3>Isabelle's Logics</h3>
|
|
5790
|
54 |
|
|
5791
|
55 |
The Isabelle distribution includes a large body of object logics and
|
|
5801
|
56 |
other examples (see the <a href="library/">Isabelle theory
|
|
5791
|
57 |
library</a>).
|
|
5790
|
58 |
|
|
|
59 |
<dl>
|
|
|
60 |
|
|
5801
|
61 |
<dt><a href="library/HOL/"><strong>Isabelle/HOL</strong></a><dd>
|
|
|
62 |
is a version of classical higher-order logic resembling that of the
|
|
|
63 |
<A HREF="http://www.cl.cam.ac.uk/Research/HVG/HOL/HOL.html">HOL System</A>.
|
|
5790
|
64 |
|
|
5801
|
65 |
<dt><a href="library/HOLCF/"><strong>Isabelle/HOLCF</strong></a><dd>
|
|
|
66 |
adds Scott's Logic for Computable Functions (domain theory) to HOL.
|
|
5790
|
67 |
|
|
5801
|
68 |
<dt><a href="library/FOL/"><strong>Isabelle/FOL</strong></a><dd>
|
|
|
69 |
provides basic classical and intuitionistic first-order logic.
|
|
|
70 |
It is polymorphic.
|
|
5790
|
71 |
|
|
5801
|
72 |
<dt><a href="library/ZF/"><strong>Isabelle/ZF</strong></a><dd>
|
|
5790
|
73 |
offers a formulation of Zermelo-Fraenkel set theory on top of FOL.
|
|
|
74 |
|
|
|
75 |
</dl>
|
|
|
76 |
|
|
|
77 |
<p>
|
|
|
78 |
|
|
|
79 |
Isabelle/HOL is currently the best developed object logic, including
|
|
|
80 |
an extensive library of (concrete) mathematics, and various packages
|
|
|
81 |
for advanced definitional concepts (like (co-)inductive sets and
|
|
|
82 |
types, well-founded recursion etc.). The distribution also includes
|
|
|
83 |
some large applications, for example correctness proofs of
|
|
|
84 |
cryptographic protocols (<a
|
|
5803
|
85 |
href="library/HOL/Auth/">HOL/Auth</a>) or communication protocols (<a
|
|
|
86 |
href="library/HOLCF/IOA/">HOLCF/IOA</a>).
|
|
5790
|
87 |
|
|
|
88 |
<p>
|
|
|
89 |
|
|
|
90 |
Isabelle/ZF provides another starting point for applications, with a
|
|
5801
|
91 |
slightly less developed library. Its definitional packages
|
|
5790
|
92 |
are similar to those of Isabelle/HOL. Untyped ZF provides more
|
|
5798
|
93 |
advanced constructions for sets than simply-typed HOL.
|
|
5790
|
94 |
|
|
|
95 |
<p>
|
|
|
96 |
|
|
5798
|
97 |
There are a few minor object logics that may serve as further
|
|
5790
|
98 |
examples: <a
|
|
5801
|
99 |
href="library/CTT/">CTT</a> is an
|
|
5790
|
100 |
extensional version of Martin-Löf's Type Theory, <a
|
|
5801
|
101 |
href="library/Cube/">Cube</a> is
|
|
5790
|
102 |
Barendregt's Lambda Cube. There are also some sequent calculus
|
|
|
103 |
examples under <a
|
|
5801
|
104 |
href="library/Sequents/">Sequents</a>,
|
|
5798
|
105 |
including modal and linear logics. Again see the <a
|
|
5801
|
106 |
href="library/">Isabelle theory
|
|
5792
|
107 |
library</a> for other examples.
|
|
5790
|
108 |
|
|
|
109 |
|
|
5803
|
110 |
<h3>Defining Logics</h3>
|
|
5790
|
111 |
|
|
|
112 |
Logics are not hard-wired into Isabelle, but formulated within
|
|
|
113 |
Isabelle's meta logic: <strong>Isabelle/Pure</strong>. There are
|
|
5791
|
114 |
quite a lot of syntactic and deductive tools available in generic
|
|
|
115 |
Isabelle. Thus defining new logics or extending existing ones
|
|
|
116 |
basically works as follows:
|
|
5790
|
117 |
|
|
|
118 |
<ol>
|
|
|
119 |
|
|
|
120 |
<li> declare concrete syntax (via mixfix grammar and syntax macros),
|
|
|
121 |
|
|
|
122 |
<li> declare abstract syntax (as higher-order constants),
|
|
|
123 |
|
|
|
124 |
<li> declare inference rules (as meta-logical propositions),
|
|
|
125 |
|
|
5800
|
126 |
<li> instantiate generic automatic proof tools (simplifier, classical
|
|
|
127 |
tableau prover etc.),
|
|
5790
|
128 |
|
|
5792
|
129 |
<li> manually code special proof procedures (via tacticals or
|
|
|
130 |
hand-written ML).
|
|
5790
|
131 |
|
|
|
132 |
</ol>
|
|
|
133 |
|
|
5798
|
134 |
The first three steps above are fully declarative and involve no ML
|
|
5791
|
135 |
programming at all. Thus one already gets a decent deductive
|
|
|
136 |
environment based on primitive inferences (by employing the built-in
|
|
|
137 |
mechanisms of Isabelle/Pure, in particular higher-order unification
|
|
|
138 |
and resolution).
|
|
5790
|
139 |
|
|
|
140 |
For sizable applications some degree of automated reasoning is
|
|
|
141 |
essential. Instantiating existing tools like the classical tableau
|
|
5791
|
142 |
prover involves only minimal ML-based setup. One may also write
|
|
5790
|
143 |
arbitrary proof procedures or even theory extension packages in ML,
|
|
|
144 |
without breaching system soundness (Isabelle follows the well-known
|
|
5792
|
145 |
<em>LCF system approach</em> to achieve a secure system).
|
|
5790
|
146 |
|
|
5805
|
147 |
<H2>Mailing list</H2>
|
|
|
148 |
|
|
|
149 |
<P>Use the mailing list
|
|
|
150 |
<A HREF="mailto: isabelle-users@cl.cam.ac.uk">isabelle-users@cl.cam.ac.uk</A>
|
|
|
151 |
to discuss problems and results.
|
|
5790
|
152 |
|
|
5801
|
153 |
|
|
5795
|
154 |
</body>
|
|
|
155 |
|
|
5790
|
156 |
</html>
|