Allyn Dimock, Ian Westmacott, Robert Muller, Franklyn Turbak,
J. B. Wells, and Jeffrey Considine.
<b>Program Representation Size in an Intermediate
Language with Intersection and Union Types.</b>
Technical Report BUCS-TR-2001-02, Computer Science Department, 
Boston University, July 31, 2001.
This is a version of [DWM+01c]
extended with an appendix describing the CIL typed intermediate language.
<hr>The CIL compiler for core Standard ML compiles whole programs using a
novel typed intermediate language (TIL) with intersection and union types
and flow 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 compile-time space costs that are potentially
much greater than are incurred in TILs employing type-level abstraction 
or quantification.  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 sufficiently 
fine-grained flow analyses together with standard hash-consing techniques.  
The data also suggests that non-duplicating formulations of intersection 
(and union) types would not achieve significantly better space complexity.<hr>[<a href="tic00tr.ps">PS</a>]  [<a href="tic00tr.pdf">PDF</a>]