Program Representation Size in an Intermediate Language with Intersection and Union Types (2000)
Cached
Download Links
| Venue: | In Proceedings of the Third Workshop on Types in Compilation (TIC 2000 |
| Citations: | 9 - 7 self |
BibTeX
@INPROCEEDINGS{Dimock00programrepresentation,
author = {Allyn Dimock and Ian Westmacott and Robert Muller and Franklyn Turbak and J. B. Wells and Jeffrey Considine},
title = {Program Representation Size in an Intermediate Language with Intersection and Union Types},
booktitle = {In Proceedings of the Third Workshop on Types in Compilation (TIC 2000},
year = {2000},
pages = {27--52},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The CIL compiler for core Standard ML compiles whole programs using a novel typed intermediate language (TIL) with intersection and union types and ow labels on both terms and types. The CIL term representation duplicates portions of the program where intersection types are introduced and union types are eliminated. This duplication makes it easier to represent type information and to introduce customized data representations. However, duplication incurs compiletime space costs that are potentially much greater than are incurred in TILs employing type-level abstraction or quanti cation. In this paper, we present empirical data on the compile-time space costs of using CIL as an intermediate language. The data shows that these costs can be made tractable by using suciently ne-grained ow analyses together with standard hash-consing techniques. The data also suggests that nonduplicating formulations of intersection (and union) types would not achieve signi cantly better space complexity.
