# HG changeset patch
# User nipkow
# Date 853781366 -3600
# Node ID 7cfa1a9c744d0a7058a8a33666f3fed5f5e568e6
# Parent  02ccf78ad0a388e9c91ad04f0ab5147631327703
Improved text.

diff -r 02ccf78ad0a3 -r 7cfa1a9c744d src/HOL/MiniML/README.html
--- a/src/HOL/MiniML/README.html	Mon Jan 20 10:27:45 1997 +0100
+++ b/src/HOL/MiniML/README.html	Mon Jan 20 18:29:26 1997 +0100
@@ -4,8 +4,9 @@
 <H1>Type Inference for MiniML</H1>
 
 This theory defines the type inference rules and the type inference algorithm
-<em>W</em> for simply-typed lambda terms due to Milner. It proves the
-soundness and completeness of <em>W</em> w.r.t. to the rules.
+<em>W</em> for MiniML (simply-typed lambda terms with <tt>let</tt>) due to
+Milner. It proves the soundness and completeness of <em>W</em> w.r.t. the
+rules.
 
 <P>