Computer Science Department
School of Computer Science, Carnegie Mellon University


The Wizard of TILT:
Efficient?, Convenient, and Abstract Type Representations

Tom Murphy

March 2002

Senior Thesis, School of Computer Science

Keywords: Types, typed intermediate languages, type representations, Standard ML, hash consing, de Bruijn indices, views

The TILT compiler for Standard ML is type-directed and type-preserving, that is, it makes use of and translates type information during the phases of compilation. Unfortunately, such use of type data incurs a significant overhead. This paper explores methods for abstractly, conveniently, and efficiently storing and manipulating type information in TILT. In the end, we discover that doing more work to reduce overhead is a bad strategy for this situation.

22 pages

Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by