--- a/src/HOL/Induct/README.html Sun Feb 04 19:41:30 2001 +0100
+++ b/src/HOL/Induct/README.html Sun Feb 04 19:41:47 2001 +0100
@@ -8,14 +8,6 @@
many other directories, such as Auth, IMP and Lambda.
<UL>
-<LI><KBD>Perm</KBD> is a simple theory of permutations of lists.
-
-<LI><KBD>FoldSet</KBD> declares a <EM>fold</EM> functional for finite sets.
-Let f be an associative-commutative function with identity e.
-For n non-negative we have
-<PRE>
-fold f e {x1,...,xn} = f x1 (... (f xn e))
-</PRE>
<LI><KBD>Comb</KBD> proves the Church-Rosser theorem for combinators (<A
HREF="http://www.cl.cam.ac.uk/ftp/papers/reports/TR396-lcp-generic-automatic-proof-tools.ps.gz">paper
@@ -38,7 +30,6 @@
</UL>
<HR>
-<P>Last modified 7 May 1997
<ADDRESS>
<A NAME="lcp@cl.cam.ac.uk" HREF="mailto:lcp@cl.cam.ac.uk">lcp@cl.cam.ac.uk</A>
--- a/src/HOL/Library/document/root.tex Sun Feb 04 19:41:30 2001 +0100
+++ b/src/HOL/Library/document/root.tex Sun Feb 04 19:41:47 2001 +0100
@@ -16,6 +16,7 @@
Gertrud Bauer \\
Tobias Nipkow \\
Lawrence C Paulson \\
+ Thomas M Rasmussen \\
Markus Wenzel}
\maketitle