Deriving algorithms from type inference systems: Application to strictness analysis (1994)
| Citations: | 25 - 9 self |
BibTeX
@MISC{Hankin94derivingalgorithms,
author = {Chris Hankin and Daniel Le Métayer},
title = {Deriving algorithms from type inference systems: Application to strictness analysis},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The role of non-standard type inference in static program analysis has been much studied recently. Early work emphasised the efficiency of type inference algorithms and paid little attention to the correctness of the inference system. Recently more powerful inference systems have been investigated but the connection with efficient inference algorithms has been obscured. The contribution of this paper is twofold: first we show how to transform a program logic into an algorithm and, second, we introduce the notion of lazy types and show how to derive an efficient algorithm for strictness analysis. 1 Introduction Two major formal frameworks have been proposed for static analysis of functional languages: abstract interpretation and type inference. A lot of work has been done to characterise formally the correctness and the power of abstract interpretation. However the development of algorithms has not kept pace with the theoretical developments. This is now a major barrier that is preven...
