15-417 HOT Compilation
Spring 2020

Karl Crary
TR Noon – 1:30
GHC 4301

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.

Prerequisite: 15-312 Principles of Programming Languages (or equivalent)

There is no textbook for the course. Attendance in lectures is essential.

Announcements

May 11 The due date for all projects is now May 14.
May 1 The final project has been issued. It is due May 11.
Apr 9 The sixth project has been issued. It is due May 1.
Mar 31 The fifth project has been issued. It is due April 21.
Feb 27 The fourth project has been issued. It is due March 19.
Feb 15 The third project's support code has been updated.
Feb 13 The third project has been issued. It is due February 27.
Feb 4 The second project has been issued. It is due February 13.
Jan 28 The first project has been issued. It is due February 4.

Topics

Jan 14 F-omega
Jan 16 Typechecking for F-omega
Jan 21 Binding
Jan 28 Singleton kinds
Feb 4 Typechecking for singleton kinds
Feb 6 Type-directed translation
Feb 11 CPS conversion
Feb 18 Closure conversion
Feb 25 Allocation
Feb 27 Module type theory
Mar 19 Phase splitting
Mar 24 Garbage collection
Mar 31 Elaboration

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.

Commenced projects

Project 1
Equivalence checking for F-omega.
Implement Equiv : EQUIV.
[
support code]
Due February 4. Submit here.

Project 2
Equivalence checking for singleton kinds.
Implement Equiv : EQUIV.
[
support code]
Due February 13. Submit here.

Project 3
CPS conversion.
Implement CpsConvert : CPS_CONVERT.
[
support code, Windows heap image (10MB), Linux heap image (9MB), Mac heap image (8MB)]
Due February 27. Submit here.

Project 4
Closure conversion.
Implement ClosureConvert : CLOSURE_CONVERT.
Implement Hoist : HOIST.
[
support code, Windows heap image (8MB), Linux heap image (8MB), Mac heap image (8MB)]
Due March 19. Submit here.

Project 5
Phase splitting.
Implement PhaseSplit : PHASE_SPLIT.
[
support code, Windows heap image (8MB), Linux heap image (9MB), Mac heap image (8MB)]
Due April 21. Submit here.

Project 6
Garbage collection.
Implement the function gc(), as described in README.
[
support code, Windows heap image (8MB), Linux heap image (8MB), Mac heap image (8MB)]
Due May 1. Submit here.

Project 7
Elaboration.
Implement Elaborate : ELABORATE.
[
support code, Windows heap image (8MB), Linux heap image (8MB), Mac heap image (8MB)]
Due May 11. Submit here.

SML/NJ runtime binaries
Windows runtime
Linux runtime
Mac runtime

Stress test sources
test1.sml
test2.sml
test3.sml
gctest.sml, gctest.c

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. 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 May 14.

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.