1337
|
1 |
<HTML><HEAD><TITLE>HOL/MiniML/ReadMe</TITLE></HEAD><BODY>
|
1345
|
2 |
<H1>Type Inference for MiniML (without <kbd>let</kbd>)</H1>
|
1337
|
3 |
|
1345
|
4 |
This theory formalizes the basic type inference algorithm underlying all
|
|
5 |
typed functional programming languages. This algorithm is called
|
|
6 |
<kbd>W</kbd>, its more imperative variant is called <kbd>I</kbd>. Both were
|
|
7 |
first described in
|
1337
|
8 |
<P>
|
|
9 |
<KBD>
|
|
10 |
@article{Milner-Poly,author="Robin Milner",
|
|
11 |
title="A Theory of Type Polymorphism in Programming",
|
|
12 |
journal="J. Comp.\ Sys.\ Sci.",year=1978,volume=17,pages="348--375"}
|
|
13 |
</KBD>
|
|
14 |
<P>
|
|
15 |
which also proves their correctness. The first completeness proof was given
|
|
16 |
in
|
|
17 |
<P>
|
|
18 |
<KBD>
|
|
19 |
@phdthesis{Damas-PhD,author={Luis Manuel Martins Damas},
|
|
20 |
title={Type Assignment in Programming Languages},
|
|
21 |
school={Department of Computer Science, University of Edinburgh},year=1985}
|
|
22 |
</KBD>
|
|
23 |
<P>
|
|
24 |
The Isabelle proofs are based on
|
|
25 |
<P>
|
|
26 |
<KBD>
|
|
27 |
@phdthesis{Nazareth-PhD,author={Dieter Nazareth},
|
|
28 |
title={A Polymorphic Sort System for Axiomatic Specification Languages},
|
|
29 |
school={Institut f\"ur Informatik, Technische Universit{\"a}t M{\"u}nchen},
|
|
30 |
year=1995,note={Technical Report {TUM-I9515}}}
|
|
31 |
</KBD>
|
1345
|
32 |
<P>
|
|
33 |
|
|
34 |
<H2>M.Sc./Diplom Project</H2>
|
|
35 |
|
|
36 |
Task: extend MiniML with a <kbd>let</kbd>-construct and polymorphic types. We
|
|
37 |
are looking for an enthusiastic student with some basic knowledge of
|
|
38 |
functional programming who is not afraid of logic and proofs. Sounds
|
|
39 |
interesting? Then contact <A
|
|
40 |
HREF="http://www4.informatik.tu-muenchen.de/~nipkow/">Tobias Nipkow</A> or <A
|
|
41 |
HREF="http://www4.informatik.tu-muenchen.de/~pusch/">Cornelia Pusch</A>.
|
|
42 |
|
|
43 |
</BODY>
|
|
44 |
</HTML>
|