To solve this homework you need some ML definitions found in
(the misnamed) hw1defs.sml.
The ML examples from class are also available in
examples.sml, as well as a
PostScript version of the homework.
There is now a solution online, as well
as some tests.
The fifth homework. Implementing the polymorphic lambda calculus, and
a lemma showing the soundness of the predicative model with respect to
type-beta reduction.
For those who don't want to type in the example code there is a
text-only version of the homework.
There is now an ML solution online, as well
as the test cases used to grade your
submissions.