Sciweavers

POPL
1995
ACM

A Type System Equivalent to Flow Analysis

13 years 8 months ago
A Type System Equivalent to Flow Analysis
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accepts exactly the same programs as safety analysis. In this paper we prove that Amadio and Cardelli’s type system with subtyping and recursive types accepts the same programs as a certain safety analysis. The proof involves mappings from types to flow information and back. As a result, we obtain an inference algorithm for the type system, thereby solving an open problem.
Jens Palsberg, Patrick O'Keefe
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where POPL
Authors Jens Palsberg, Patrick O'Keefe
Comments (0)