Loading...
Please wait, while we are loading the content...
Similar Documents
Deriving algorithms from type inference systems: application to strictness analysis (1994).
| Content Provider | CiteSeerX |
|---|---|
| Author | Hankin, Chris Métayer, Daniel Le |
| 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... |
| File Format | |
| Publisher Date | 1994-01-01 |
| Access Restriction | Open |
| Subject Keyword | Type Inference System Abstract Interpretation Early Work Theoretical Development Type Inference Strictness Analysis Non-standard Type Inference Major Barrier Efficient Inference Algorithm Type Inference Algorithm Static Analysis Lazy Type Program Logic Inference System Major Formal Framework Efficient Algorithm Functional Language Static Program Analysis Powerful Inference System Little Attention |
| Content Type | Text |
| Resource Type | Article |
