Refined Type Inference for ML
- Manuel Fahndrich ,
- Alexander Aiken
Proceedings of the 1st Workshop on Types in Compilation |
Inclusion constraints over set-expressions [1, 4] provide a general formalism to express a large class of program analyses. Over the past two years, we have experimented with inclusion constraints to model dataflow in type-based analyses. One of our research goals is to determine how to structure and implement precise constraint-based analyses such that they scale to large programs. Program analyses with O(n3)complexity bounds often exhibit their worstcase complexity in practice and consequently do not scale beyond programs of a few thousand lines. As a result, coarser but faster analyses are usually used [2, 10].