Polymorphic Strictness Analysis Using Frontiers (1992)
| Venue: | Proceedings of the 1993 ACM on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '93), ACM |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Seward92polymorphicstrictness,
author = {Julian Seward},
title = {Polymorphic Strictness Analysis Using Frontiers},
booktitle = {Proceedings of the 1993 ACM on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '93), ACM},
year = {1992},
pages = {186--193},
publisher = {Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algorithm. A central notion is to only ever analyse each function once, at its simplest polymorphic instance. Subsequent non-base uses of functions are dealt with by generalising their simplest instance analyses. This generalisation is done using an algorithm developed by Baraki, based on embedding-closure pairs. Compared with an alternative approach of expanding the program out into a collection of monomorphic instances, this technique is hundreds of times faster for realistic programs. There are some approximations involved, but these do not seem to have a detrimental effect on the overall result. The overall effect of this technology is to considerably expand the range of programs for which the Frontiers algorithm gives useful results reasonably quickly. 1 Introduction The Frontiers algorithm was introduced in [CP85 ] as an allegedly efficient way of doing forwards strictness analysis, al...
