Compiler Construction Course

Scheme is the main programming language for the first part of the course. It is a semi-functional, late-binding, dynamically-typed, interactive programming language. It is the most suitable language for working with the untyped lambda calculus. For this course, I'm going to ask you to work with Petite Chez Scheme, which is avaiable for free on most common platforms. You are welcome to try out other Scheme systems (there are even a couple for the iPhone! ☺ ), but for the purpose of the assignments, please make sure your code runs on Chez. Click here to go to my Scheme page.

ML is the second language we shall be using the the first part of the course. It is a semi-functional, early-binding, statically-typed interactive programming language. We shall be using it in our discussions on types, and perhaps in other places as well. Click here to go to my ML page.