--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/HOL/MiniML/README.html	Fri Nov 17 12:08:04 1995 +0100
@@ -0,0 +1,30 @@
+<HTML><HEAD><TITLE>HOL/MiniML/ReadMe</TITLE></HEAD><BODY>
+<H2>Type Inference for MiniML</H2>
+<H3>(without "let" for the time being)</H3>
+
+Algorithms W and I are based on
+<P>
+<KBD>
+@article{Milner-Poly,author="Robin Milner",
+title="A Theory of Type Polymorphism in Programming",
+journal="J. Comp.\ Sys.\ Sci.",year=1978,volume=17,pages="348--375"}
+</KBD>
+<P>
+which also proves their correctness.  The first completeness proof was given
+in
+<P>
+<KBD>
+@phdthesis{Damas-PhD,author={Luis Manuel Martins Damas},
+title={Type Assignment in Programming Languages},
+school={Department of Computer Science, University of Edinburgh},year=1985}
+</KBD>
+<P>
+The Isabelle proofs are based on
+<P>
+<KBD>
+@phdthesis{Nazareth-PhD,author={Dieter Nazareth},
+title={A Polymorphic Sort System for Axiomatic Specification Languages},
+school={Institut f\"ur Informatik, Technische Universit{\"a}t M{\"u}nchen},
+year=1995,note={Technical Report {TUM-I9515}}}
+</KBD>
+</BODY></HTML>