CS 515: Programming Languages and Compilers I
Fall 2011 Project 2
Static Type Reconstruction in Polymorphic TINY
Due date: Tuesday, Nov. 29. at midnight
Modifications and Clarifications
Project Description
You will implement a static type reconstruction algorithm TRA for
a modified TINY language. TRA takes as input a program AST, a type variable
environment, and a set of constraints. TRA computes the type
expression associated with the TINY program. If a type expression
cannnot be computed, the program does not compile (static type
checking).
Here is the project description .
Provided Code
The following code is provided as a starting point for your
project.
- Parser: parse.scm *** DO NOT MODIFY
THE PARSER*** . The parser is also available on the ilab cluster
in the ~uli/cs515/projects/proj2 subdirectory.
Due Date
This project is due at 11:59 pm on November 29
2011--that is, one minute before midnight.
If you have specific, overriding,
personal reasons why these dates are unreasonable, you should discuss
them directly with the instructor before the deadline.
Submission Procedure
As in the previous project, we will use our sakai web site. You should
include
a ReadMe file to communicate specific issues about your project with
the TA.
Grading Criteria
The project will be mainly graded on functionality. We will use a test
suite of test programs. You will receive no credit for the entire project if your
code does not run on the ilab machines.