This paper surveys type-based program analysis with an emphasis on the polyvariant program analyses that can be obtained using conjunctive (or intersection) types and parametric polymorphism. In particular, we show 1) how binding-time analysis and strictness analysis are variations of a common framework based on conjunctive types, 2) that the standard abstract interpretation used for strictness analysis is equivalent to the type-based analysis, and 3) that the conjunctive strictness analysis can be made more modular by blending conjunctions with parametric polymorphism. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Jensen, T. (2002). Types in program analysis. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2566 LNCS, 204–222. https://doi.org/10.1007/3-540-36377-7_10
Mendeley helps you to discover research relevant for your work.