Using projection analysis of evaluation-order and its application
- 1 May 1990
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 227-240
- https://doi.org/10.1145/91556.91655
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.Keywords
This publication has 7 references indexed in Scilit:
- A relationship between abstract interpretation and projection analysisPublished by Association for Computing Machinery (ACM) ,1990
- Two-level semantics and abstract interpretationTheoretical Computer Science, 1989
- The spineless tagless G-machinePublished by Association for Computing Machinery (ACM) ,1989
- The spineless G-machinePublished by Association for Computing Machinery (ACM) ,1988
- Compiling strictness into streamsPublished by Association for Computing Machinery (ACM) ,1987
- Strictness analysis for higher-order functionsScience of Computer Programming, 1986
- Systematic design of program analysis frameworksPublished by Association for Computing Machinery (ACM) ,1979