15-814 Types and Programming Languages
At various points in the course we may use small prototype
implementations of the languages we are developing. Binaries
for CMU students will be available at
A source distributions you may also be available (see below).
A small illustrative implementation of the untyped λ-calculus,
the polymorphic λ-calculus, and the core of a call-by-value functional
You can find some information in readme.txt
and some examples at examples/.
To run this on the linux.andrew.cmu.edu machines, invoke
or (for polymorphically typed code)
$ ~fp/bin/lambda myexample.lam
or (for call-by-value typed code)
$ ~fp/bin/lambda myexample.poly
or (for checking proofs in intuitionistic propositional logic)
$ ~fp/bin/lambda myexample.cbv
$ ~fp/bin/lambda myexample.prf
For installation instructions see the file
in the distribution. You will need
the mlton compiler for Standard ML,
but it also runs with SML/NJ.