Admin/page/index.html

--- a/Admin/page/index.html	Tue Nov 03 17:44:16 1998 +0100
+++ b/Admin/page/index.html	Wed Nov 04 13:00:15 1998 +0100
@@ -31,28 +31,23 @@
 <h2>Object logics</h2>
 
 The Isabelle distribution includes a large body of object logics and
-other examples (see the <a
-href="http://www.in.tum.de/~isabelle/library/">Isabelle theory
+other examples (see the <a href="library/">Isabelle theory
 library</a>).
 
 <dl>
 
-<dt><a
-href="http://www.in.tum.de/~isabelle/library/HOL/"><strong>Isabelle/HOL</strong></a><dd>
-is a version of classical higher-order logic, similar to Gordon's HOL
-(it is related to Church's Simple Theory of Types).
+<dt><a href="library/HOL/"><strong>Isabelle/HOL</strong></a><dd>
+is a version of classical higher-order logic resembling that of the
+<A HREF="http://www.cl.cam.ac.uk/Research/HVG/HOL/HOL.html">HOL System</A>.
 
-<dt><a
-href="http://www.in.tum.de/~isabelle/library/HOLCF/"><strong>Isabelle/HOLCF</strong></a><dd>
-adds a considerably amount of Scott's domain theory to HOL.
+<dt><a href="library/HOLCF/"><strong>Isabelle/HOLCF</strong></a><dd>
+adds Scott's Logic for Computable Functions (domain theory) to HOL.
 
-<dt><a
-href="http://www.in.tum.de/~isabelle/library/FOL/"><strong>Isabelle/FOL</strong></a><dd>
-provides basic classical and intuitionistic first-order logic
-(polymorphic).
+<dt><a href="library/FOL/"><strong>Isabelle/FOL</strong></a><dd>
+provides basic classical and intuitionistic first-order logic.
+It is polymorphic.
 
-<dt><a
-href="http://www.in.tum.de/~isabelle/library/ZF/"><strong>Isabelle/ZF</strong></a><dd>
+<dt><a href="library/ZF/"><strong>Isabelle/ZF</strong></a><dd>
 offers a formulation of Zermelo-Fraenkel set theory on top of FOL.
 
 </dl>
@@ -65,12 +60,12 @@
 types, well-founded recursion etc.).  The distribution also includes
 some large applications, for example correctness proofs of
 cryptographic protocols (<a
-href="http://www.in.tum.de/~isabelle/library/HOL/Auth/">HOL/Auth</a>).
+href="library/HOL/Auth/">HOL/Auth</a>).
 
 <p>
 
 Isabelle/ZF provides another starting point for applications, with a
-slightly less developed library, though.  Its definitional packages
+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.
 
@@ -78,14 +73,14 @@
 
 There are a few minor object logics that may serve as further
 examples: <a
-href="http://www.in.tum.de/~isabelle/library/CTT/">CTT</a> is an
+href="library/CTT/">CTT</a> is an
 extensional version of Martin-L&ouml;f's Type Theory, <a
-href="http://www.in.tum.de/~isabelle/library/Cube/">Cube</a> is
+href="library/Cube/">Cube</a> is
 Barendregt's Lambda Cube.  There are also some sequent calculus
 examples under <a
-href="http://www.in.tum.de/~isabelle/library/Sequents/">Sequents</a>,
+href="library/Sequents/">Sequents</a>,
 including modal and linear logics.  Again see the <a
-href="http://www.in.tum.de/~isabelle/library/">Isabelle theory
+href="library/">Isabelle theory
 library</a> for other examples.
 
 
@@ -127,15 +122,21 @@
 <em>LCF system approach</em> to achieve a secure system).
 
 
+<H2>Mailing list</H2>
+
+<P>Use the mailing list 
+<A HREF="mailto: [e-mail]">[e-mail]</A> 
+to discuss problems and results.  
+
 <h2>Further information</h2>
 
-<a href="http://www.cl.cam.ac.uk/Research/HVG/cambridge.html"><img
+<a href="http://www.cl.cam.ac.uk/Research/HVG/Isabelle/cambridge.html"><img
 src="cambridge.gif" width=145 border=0 align=right
 alt="[Cambridge]"></a> <a
 href="http://www.in.tum.de/~isabelle/munich.html"><img
 src="munich.gif" width=48 border=0 align=right alt="[Munich]"></a> The
-local Isabelle pages at <a
-href="http://www.cl.cam.ac.uk/Research/HVG/cambridge.html">Cambridge</a>
+cambridge Isabelle pages at <a
+href="http://www.cl.cam.ac.uk/Research/HVG/Isabelle/cambridge.html">Cambridge</a>
 and <a href="http://www.in.tum.de/~isabelle/munich.html">Munich</a>
 provide further information on Isabelle and related projects.