Abstract

. We establish a series of equivalences between type systems and control-flow analyses. Specifically, we take four type systems from the literature (involving simple types, subtypes and recursion) and conservatively extend them to reason about control-flow information. Similarly, we take four standard control-flow systems and conservatively extend them to reason about type consistency. Our main result is that we can match up the resulting type and control-flow systems such that we obtain pairs of equivalent systems, where the equivalence is with respect to both type and control-flow information. In essence, type systems and control-flow analysis can be viewed as complementary approaches for addressing questions of type consistency and control-flow. Recent and independent work by Palsberg and O'Keefe has addressed the same general question. Our work differs from theirs in two respects. First, they only consider what happens when control-flow systems are used to reason about types. In co...

Citations

873	A theory of type polymorphism in programming - Milner - 1978
180	Control flow analysis in Scheme - Shivers - 1988
84	A type system equivalent to flow analysis - Palsberg, O’Keefe - 1995
43	Efficient recursive subtyping - Kozen, Palsberg, et al. - 1995
38	Type inference with partial types - Thatte - 1988
36	Safety analysis versus type inference - Palsberg, Schwartzbach - 1995
30	Flow analysis of lazy higher-order functional programs - Jones, Andersen - 2007
29	Safety analysis versus type inference for partial types - Palsberg, Schwartzbach - 1992
28	Flow Analysis of Lambda Expressions - Jones - 1981
25	Separate abstract interpretation for control-flow analysis - Tang, Jouvelot - 1994
13	Efficient analysis for realistic off-line partial evaluation - Bondorf, Jorgensen - 1993
6	Control-Flow Effects for Escape Analysis - Tang, Jouvelot - 1992
1	Subtyping Recursive types", ACM-TOPLAS - Amadio, Cardelli - 1993