Abstract
We establish a series of equivalencies between type systems and control-flow analyses. Specifically, we take four type systems from the literature (involving simple types, subtypes and recursion) and conservatively enrich them to reason about control-flow information. Similarly, we take four standard control-flow systems and conservatively enrich them to reason about type consistency. Our main result is that for each type system, there is a control-flow system with equivalent reasoning power. In essence, type systems and control-flow analysis can be viewed as complementary approaches for addressing questions of type consistency and control-flow.

This publication has 0 references indexed in Scilit: