# HG changeset patch # User wenzelm # Date 910357139 -3600 # Node ID 9d30b79832e8b28bfa4b554b33f753c1b62b4f80 # Parent e867bc95a47d26e7112596b0685e231cfdaa66c5 tuned; diff -r e867bc95a47d -r 9d30b79832e8 Admin/page/index.html --- a/Admin/page/index.html Fri Nov 06 13:42:13 1998 +0100 +++ b/Admin/page/index.html Fri Nov 06 13:58:59 1998 +0100 @@ -34,15 +34,14 @@ Isabelle workshops and courses. +

Obtaining Isabelle

-

Obtaining Isabelle

The latest version is Isabelle98-1, it is available -from several -mirror sites. - +from several mirror sites.

What is Isabelle?

+ Isabelle can be viewed from two main perspectives. On the one hand it may serve as a generic framework for rapid prototyping of deductive systems. On the other hand, major existing logics like @@ -58,19 +57,20 @@
-
Isabelle/HOL
-is a version of classical higher-order logic resembling that of the -HOL System. +
Isabelle/HOL
is a +version of classical higher-order logic resembling that of the HOL +System.
Isabelle/HOLCF
adds Scott's Logic for Computable Functions (domain theory) to HOL.
Isabelle/FOL
-provides basic classical and intuitionistic first-order logic. -It is polymorphic. +provides basic classical and intuitionistic first-order logic. It is +polymorphic. -
Isabelle/ZF
-offers a formulation of Zermelo-Fraenkel set theory on top of FOL. +
Isabelle/ZF
offers +a formulation of Zermelo-Fraenkel set theory on top of FOL.
@@ -81,30 +81,25 @@ for advanced definitional concepts (like (co-)inductive sets and types, well-founded recursion etc.). The distribution also includes some large applications, for example correctness proofs of -cryptographic protocols (HOL/Auth) or communication protocols (HOLCF/IOA). +cryptographic protocols (HOL/Auth) or +communication protocols (HOLCF/IOA).

Isabelle/ZF provides another starting point for applications, with a -slightly less developed library. Its definitional packages -are similar to those of Isabelle/HOL. Untyped ZF provides more -advanced constructions for sets than simply-typed HOL. +slightly less developed library. Its definitional packages are +similar to those of Isabelle/HOL. Untyped ZF provides more advanced +constructions for sets than simply-typed HOL.

There are a few minor object logics that may serve as further -examples: CTT is an -extensional version of Martin-Löf's Type Theory, Cube is +examples: CTT is an extensional version of +Martin-Löf's Type Theory, Cube is Barendregt's Lambda Cube. There are also some sequent calculus -examples under Sequents, -including modal and linear logics. Again see the Isabelle theory -library for other examples. +examples under Sequents, including +modal and linear logics. Again see the Isabelle +theory library for other examples.

Defining Logics

@@ -144,12 +139,12 @@ without breaching system soundness (Isabelle follows the well-known LCF system approach to achieve a secure system). -

Mailing list

- -

Use the mailing list - isabelle-users@cl.cam.ac.uk - to discuss problems and results. + +

Mailing list

+Use the mailing list isabelle-users@cl.cam.ac.uk to +discuss problems and results.