# HG changeset patch # User wenzelm # Date 969283261 -7200 # Node ID 7564e6723fb8ffcc5a9adf2a973a171204519744 # Parent 7600cd36ec61683b2ce13619af15902b46a8260e tuned; diff -r 7600cd36ec61 -r 7564e6723fb8 Admin/page/main-content/index.content --- a/Admin/page/main-content/index.content Mon Sep 18 14:49:58 2000 +0200 +++ b/Admin/page/main-content/index.content Mon Sep 18 15:21:01 2000 +0200 @@ -5,9 +5,8 @@

-

Isabelle

-is a popular generic theorem proving -environment developed at Cambridge University (Larry Paulson) and TU Munich (Tobias Nipkow). @@ -31,29 +30,24 @@ archives, research papers, the Isabelle bibliography, and Isabelle workshops and courses. -

Obtaining Isabelle

-See the download page. -

- Several mirror sites provide the Isabelle distribution, which includes source and binary packages and browsable distribution, which includes source and +binary packages and browsable documentation. The current version is .

-You can also browse the Isabelle theory library; -the main logics are HOL, HOLCF, FOL and ZF. +You can also browse the Isabelle theory +library; the main logics are HOL, HOLCF, FOL and ZF. -

Mailing list

diff -r 7600cd36ec61 -r 7564e6723fb8 Admin/page/main-content/logics.content --- a/Admin/page/main-content/logics.content Mon Sep 18 14:49:58 2000 +0200 +++ b/Admin/page/main-content/logics.content Mon Sep 18 15:21:01 2000 +0200 @@ -2,7 +2,6 @@ Isabelle's Logics %body% -

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 @@ -19,20 +18,24 @@
-
Isabelle/HOL
is a -version of classical higher-order logic resembling that of the Isabelle/HOL
is +a version of classical higher-order logic resembling that of the HOL System. -
Isabelle/HOLCF
+
Isabelle/HOLCF
adds Scott's Logic for Computable Functions (domain theory) to HOL. -
Isabelle/FOL
+
Isabelle/FOL
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.
@@ -43,8 +46,9 @@ 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).

@@ -56,11 +60,12 @@

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 -Barendregt's Lambda Cube. There are also some sequent calculus -examples under Sequents, including -modal and linear logics. Again see the Isabelle +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. diff -r 7600cd36ec61 -r 7564e6723fb8 Admin/page/main-content/munich.content --- a/Admin/page/main-content/munich.content Mon Sep 18 14:49:58 2000 +0200 +++ b/Admin/page/main-content/munich.content Mon Sep 18 15:21:01 2000 +0200 @@ -14,6 +14,7 @@ Munich (Tobias Nipkow). This is the local page of the Munich group. +

People

The following people are involved in Isabelle applications or