# HG changeset patch
# User wenzelm
# Date 981312107 -3600
# Node ID 026007eb2ccc76eea71162b716424e172bafba2c
# Parent  1379e49c0ee961250a670c4d2a256d1c9560521a
updated

diff -r 1379e49c0ee9 -r 026007eb2ccc src/HOL/Induct/README.html
--- 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>
diff -r 1379e49c0ee9 -r 026007eb2ccc src/HOL/Library/document/root.tex
--- 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