--- a/lib/html/index1.html Thu Aug 27 11:19:35 1998 +0200
+++ b/lib/html/index1.html Thu Aug 27 11:50:18 1998 +0200
@@ -1,34 +1,52 @@
-<HTML><HEAD><TITLE>Isabelle Logics ({ISABELLE})</TITLE></HEAD>
-<center>
- <img src="gif/isabelle.gif"><P>
-</center>
-<P>
-Switch to <A HREF="graph/index.html">Java-based</A> version, including theory graph browser.
-<P>
+<html>
+
+<head><title>Isabelle Logics ({ISABELLE})</title></head>
+
+<body>
+
+<img src="gif/isabelle.gif" alt="Isabelle" align=center>
+
+<p>
+
+Switch to <a href="graph/index.html">Java-based</a> version, including
+theory graph browser.
+
+<p>
+
Click on the logic's name to view a list of its theories.
-<HR>
+
+<hr>
+
First-Order Logic
- <UL>
- <LI><A HREF = "FOL/index.html">FOL</A>
- <LI><A HREF = "ZF/index.html">ZF (Set Theory)</A>
- <LI><A HREF = "CCL/index.html">CCL (Classical Computational Logic)</A>
- <LI><A HREF = "LCF/index.html">LCF (Logic of Computable Functions)</A>
- <LI><A HREF = "FOLP/index.html">FOLP (FOL with Proof Terms)</A>
- </UL>
-<HR>
+
+<ul>
+<li><a href="FOL/index.html">FOL</a>
+<li><a href="ZF/index.html">ZF (Set Theory)</a>
+<li><a href="CCL/index.html">CCL (Classical Computational Logic)</a>
+<li><a href="LCF/index.html">LCF (Logic of Computable Functions)</a>
+<li><a href="FOLP/index.html">FOLP (FOL with Proof Terms)</a>
+</ul>
+
+<hr>
+
Higher-Order Logic
- <UL>
- <LI><A HREF = "HOL/index.html">HOL</A>
- <LI><A HREF = "HOLCF/index.html">HOLCF
- (Higher-Order Logic of Computable Functions)</A>
- </UL>
-<HR>
+
+<ul>
+<li><a href="HOL/index.html">HOL</a>
+<li><a href="HOLCF/index.html">HOLCF (Higher-Order Logic of Computable Functions)</a>
+</ul>
+
+<hr>
+
Miscellaneous
- <UL>
- <LI><A HREF = "Sequents/index.html">Sequents
- (first-order, modal and linear logics)</A>
- <LI><A HREF = "CTT/index.html">CTT (Constructive Type Theory)</A>
- <LI><A HREF = "Cube/index.html">Cube (The Lambda Cube)</A>
- </UL>
-<HR>
-</BODY></HTML>
+
+<ul>
+<li><a href="Sequents/index.html">Sequents (first-order, modal and linear logics)</a>
+<li><a href="CTT/index.html">CTT (Constructive Type Theory)</a>
+<li><a href="Cube/index.html">Cube (The Lambda Cube)</a>
+</ul>
+
+<hr>
+
+</body>
+</html>
--- a/lib/html/index2.html Thu Aug 27 11:19:35 1998 +0200
+++ b/lib/html/index2.html Thu Aug 27 11:50:18 1998 +0200
@@ -1,34 +1,51 @@
-<HTML><HEAD><TITLE>Isabelle Logics ({ISABELLE})</TITLE></HEAD>
-<center>
- <img src="../gif/isabelle.gif"><P>
-</center>
-<P>
-Switch to <A HREF="../index.html">plain HTML</A> version.
-<P>
+<html>
+
+<head><title>Isabelle Logics ({ISABELLE})</title></head>
+
+<body>
+
+<img src="../gif/isabelle.gif" alt="Isabelle" align=center>
+
+<p>
+
+Switch to <a href="../index.html">plain HTML</a> version.
+
+<p>
+
Click on the logic's name to view the graph of its theories.
-<HR>
+
+<hr>
+
First-Order Logic
- <UL>
- <LI><A HREF = "data/FOL/large.html">FOL</A>
- <LI><A HREF = "data/ZF/large.html">ZF (Set Theory)</A>
- <LI><A HREF = "data/CCL/large.html">CCL (Classical Computational Logic)</A>
- <LI><A HREF = "data/LCF/large.html">LCF (Logic of Computable Functions)</A>
- <LI><A HREF = "data/FOLP/large.html">FOLP (FOL with Proof Terms)</A>
- </UL>
-<HR>
+
+<ul>
+<li><a href="data/FOL/large.html">FOL</a>
+<li><a href="data/ZF/large.html">ZF (Set Theory)</a>
+<li><a href="data/CCL/large.html">CCL (Classical Computational Logic)</a>
+<li><a href="data/LCF/large.html">LCF (Logic of Computable Functions)</a>
+<li><a href="data/FOLP/large.html">FOLP (FOL with Proof Terms)</a>
+</ul>
+
+<hr>
+
Higher-Order Logic
- <UL>
- <LI><A HREF = "data/HOL/large.html">HOL</A>
- <LI><A HREF = "data/HOLCF/large.html">HOLCF
- (Higher-Order Logic of Computable Functions)</A>
- </UL>
-<HR>
+
+<ul>
+<li><a href="data/HOL/large.html">HOL</a>
+<li><a href="data/HOLCF/large.html">HOLCF (Higher-Order Logic of Computable Functions)</a>
+</ul>
+
+<hr>
+
Miscellaneous
- <UL>
- <LI><A HREF = "data/Sequents/large.html">Sequents
- (first-order, modal and linear logics)</A>
- <LI><A HREF = "data/CTT/large.html">CTT (Constructive Type Theory)</A>
- <LI><A HREF = "data/Cube/large.html">Cube (The Lambda Cube)</A>
- </UL>
-<HR>
-</BODY></HTML>
+
+<ul>
+<li><a href="data/Sequents/large.html">Sequents (first-order, modal and linear logics)</a>
+<li><a href="data/CTT/large.html">CTT (Constructive Type Theory)</a>
+<li><a href="data/Cube/large.html">Cube (The Lambda Cube)</a>
+</ul>
+
+<hr>
+
+</body>
+</html>
--- a/src/HOL/TLA/README.html Thu Aug 27 11:19:35 1998 +0200
+++ b/src/HOL/TLA/README.html Thu Aug 27 11:50:18 1998 +0200
@@ -26,7 +26,7 @@
The distribution includes the following examples:
<UL>
- <li> a verification of Lamport's <quote>increment</quote> example
+ <li> a verification of Lamport's <em>increment</em> example
(subdirectory inc),<P>
<li> a proof that two buffers in a row implement a single buffer
--- a/src/Sequents/README.html Thu Aug 27 11:19:35 1998 +0200
+++ b/src/Sequents/README.html Thu Aug 27 11:50:18 1998 +0200
@@ -41,5 +41,5 @@
Linear Logic in Isabelle (in TR 379, University of Cambridge
Computer Lab, 1995, ed L. Paulson)
</UL>
-</UL>
+
</BODY></HTML>
--- a/src/ZF/ex/README.html Thu Aug 27 11:19:35 1998 +0200
+++ b/src/ZF/ex/README.html Thu Aug 27 11:50:18 1998 +0200
@@ -5,7 +5,7 @@
<P>Examples on this directory include a simple form of Ramsey's theorem. A
<A
-HREF="http://www.cl.cam.ac.uk/Research/Reports/TR271-lcp-set-theory.dvi.Z"">report</A>
+HREF="http://www.cl.cam.ac.uk/Research/Reports/TR271-lcp-set-theory.dvi.Z">report</A>
is available.
<P>Several (co)inductive and (co)datatype definitions are presented. <A HREF="http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz">One report</A> describes the theoretical foundations of datatypes while <A HREF="http://www.cl.cam.ac.uk/Research/Reports/TR320-lcp-isabelle-ind-defs.dvi.gz">another</A> describes the package that automates their declaration.