Using Projection Analysis in Compiling Lazy Functional Programs

Using Projection Analysis in Compiling Lazy Functional Programs (1990)

Cached

Download Links

[sunsite.doc.ic.ac.uk]

by G.L. Burn

Venue:	In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming
Citations:	15 - 6 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Using Projection Analysis in Compiling Lazy Functional Programs	user correction - Legacy Corrections
AUTHOR NAME	G.L. Burn	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computing, Imperial College, 180 Queen's Gate,	user correction - Legacy Corrections
AUTHOR ADDR	London SW7 2BZ. United Kingdom.	user correction - Legacy Corrections
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...	user correction - Legacy Corrections
YEAR	1990	INFERENCE
VENUE	In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	227--241	INFERENCE
CITATIONS	22 found	ParsCit 1.0