15-417 HOT CompilationFall 2015

Course Information

The course covers the implementation of compilers for higher-order
typed languages such as ML. Topics include type checking, type
directed compilation, elaboration, phase splitting, CPS conversion,
closure conversion, allocation, and garbage collection. The course is
disjoint from the standard compilers course (15-411); thus, topics
such as parsing and code generation are not covered. Students will
implement an ML compiler and runtime system as a term project.

Projects

Students will complete several projects through which they will
implement an ML compiler and runtime system.

Form of projects

For each project, students will be given a Standard ML signature to
implement. The intended meaning of that signature will be made clear
in class. Attendance in lectures is essential.

This signature to implement will be included in a collection of
resource code that we will supply. Students should not modify any
resource code. (Since projects will be graded using the original
resource code, any modifications will likely result in project
failure.)

On some occasions, we may supply some resource code in executable
form, without supplying source code. We will do so by supplying an
SML of New Jersey image extended with the relevant code.

Project submission

Students should hand in their projects by concatenating their source code into
a single file and submitting it to Autolab.

This file should not include the resource code that we supply.
Also, this file should not contain diagnostic code; submissions should
not print anything to console.

Grading

Grading is based on the number of successfully completed projects.
For each project, students will submit their solution by the project's
due date. On the due date, the projects will be graded automatically
using a variety of test cases. If a student's solution passes all
tests, the project will be marked as completed. If not, no score will
be recorded and the student will have the opportunity to correct
his/her solution. Students will be given a second-pass due date, by
which they must submit their revised solution, which will be tested in
a similar fashion to his/her original submission. This process
continues until the project has been completed, or the course has
ended.

The final due date for all projects and project revisions is December 21.

Students are urged not to try to exploit the system by turning in
"token" submissions to procrastinate a project. This places students
in the unfortunate position of having to complete several earlier
projects during the busiest part of their semester. Therefore, token
submission will not be accepted. If, in the judgement of the
instructor, any submission does not represent a credible effort, the
project will be marked as failed, and no further submissions for that
project will be accepted.

It is expected that most students will successfully complete all
the projects and earn an A for the course.