--- a/src/HOL/Lex/README.html Sat Nov 18 14:55:44 1995 +0100
+++ b/src/HOL/Lex/README.html Sat Nov 18 15:35:24 1995 +0100
@@ -1,7 +1,7 @@
<HTML><HEAD><TITLE>HOL/Lex/ReadMe</TITLE></HEAD>
<BODY>
-<H2>A Simplified Scanner Generator</H2>
+<H1>A Simplified Scanner Generator</H1>
This is half of a simplified functional scanner generator. The overall design
is like this:
@@ -34,8 +34,15 @@
diagram, i.e. the translation of regular expressions into deterministic
finite automata is still missing. <P>
-<B>WANTED:</B> a theoretically inclined student to formalize a bit of
-undergraduate level automata theory. This could be worth a "Diplom" or an
-M.Sc. It could also be undertaken as a two-person "Fopra".
+<H2>M.Sc./Diplom/Fopra Project</H2>
+
+Task: formalize the translation of regular expressions into deterministic
+finite automata. We are looking for a theoretically inclined student who
+likes automata theory and is not afraid of logic and proofs. Sounds
+interesting? Then contact <A
+HREF="http://www4.informatik.tu-muenchen.de/~nipkow/">Tobias Nipkow</A> or <A
+HREF="http://www4.informatik.tu-muenchen.de/~pusch/">Cornelia Pusch</A>.
+This project is also suitable as a joint "Fopra" for two students.
+
</BODY>
</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 @@
<HTML><HEAD><TITLE>HOL/MiniML/ReadMe</TITLE></HEAD><BODY>
-<H2>Type Inference for MiniML</H2>
-<H3>(without "let" for the time being)</H3>
+<H1>Type Inference for MiniML (without <kbd>let</kbd>)</H1>
-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
+<kbd>W</kbd>, its more imperative variant is called <kbd>I</kbd>. Both were
+first described in
<P>
<KBD>
@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}}}
</KBD>
-</BODY></HTML>
+<P>
+
+<H2>M.Sc./Diplom Project</H2>
+
+Task: extend MiniML with a <kbd>let</kbd>-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 <A
+HREF="http://www4.informatik.tu-muenchen.de/~nipkow/">Tobias Nipkow</A> or <A
+HREF="http://www4.informatik.tu-muenchen.de/~pusch/">Cornelia Pusch</A>.
+
+</BODY>
+</HTML>