diff -r f172a7f14e49 -r d4e26f632bca src/HOL/MiniML/README.html
--- a/src/HOL/MiniML/README.html Sat Nov 18 14:55:44 1995 +0100
+++ b/src/HOL/MiniML/README.html Sat Nov 18 15:35:24 1995 +0100
@@ -1,8 +1,10 @@
HOL/MiniML/ReadMe
-Type Inference for MiniML
-(without "let" for the time being)
+Type Inference for MiniML (without let)
-Algorithms W and I are based on
+This theory formalizes the basic type inference algorithm underlying all
+typed functional programming languages. This algorithm is called
+W, its more imperative variant is called I. Both were
+first described in
@article{Milner-Poly,author="Robin Milner",
@@ -27,4 +29,16 @@
school={Institut f\"ur Informatik, Technische Universit{\"a}t M{\"u}nchen},
year=1995,note={Technical Report {TUM-I9515}}}
-
+
+
+
M.Sc./Diplom Project
+
+Task: extend MiniML with a let-construct and polymorphic types. We
+are looking for an enthusiastic student with some basic knowledge of
+functional programming who is not afraid of logic and proofs. Sounds
+interesting? Then contact Tobias Nipkow or Cornelia Pusch.
+
+
+