User loginNavigation |
A Type System Equivalent to Flow Analysis
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. I believe it's instructive to see type systems in this light. Did we discuss something like this recently? |
Browse archivesActive forum topics |
Recent comments
7 weeks 2 days ago
7 weeks 4 days ago
7 weeks 5 days ago
14 weeks 5 days ago
20 weeks 3 days ago
20 weeks 4 days ago
21 weeks 3 days ago
24 weeks 1 day ago
25 weeks 4 days ago
25 weeks 4 days ago