Using Projection Analysis in Compiling Lazy Functional Programs (1990)
| Venue: | In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming |
| Citations: | 15 - 6 self |
BibTeX
@INPROCEEDINGS{Burn90usingprojection,
author = {G.L. Burn},
title = {Using Projection Analysis in Compiling Lazy Functional Programs},
booktitle = {In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming},
year = {1990},
pages = {227--241},
publisher = {ACM}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Projection analysis is a technique for finding out information about lazy functional programs. We show how the information obtained from this analysis can be used to speed up sequential implementations, and introduce parallelism into parallel implementations. The underlying evaluation model is evaluation transformers, where the amount of evaluation that is allowed of an argument in a function application depends on the amount of evaluation allowed of the application. We prove that the transformed programs preserve the semantics of the original programs. Compilation rules, which encode the information from the analysis, are given for sequential and parallel machines. 1 Introduction A number of analyses have been developed which find out information about programs. The methods that have been developed fall broadly into two classes, forwards analyses such as those based on the ideas of abstract interpretation (e.g. [9, 18, 19, 7, 17, 12, 4, 20]), and backward analyses such as those based...
