Higher Order Deforestation

Higher Order Deforestation (1995)

by G.W. Hamilton , St Bg

Citations:

16 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Higher Order Deforestation	user correction - Legacy Corrections
AUTHOR NAME	G.W. Hamilton	user correction - Legacy Corrections
AUTHOR NAME	St Bg	user correction - Legacy Corrections
AUTHOR AFFIL	; U.K.	user correction - Legacy Corrections
AUTHOR ADDR	; 621111; 01782	user correction - Legacy Corrections
ABSTRACT	Intermediate data structures are widely used in functional programs. Programs which use these intermediate structures are usually a lot easier to understand, but they result in loss of efficiency at run-time. In order to reduce these run-time costs, a transformation algorithm called deforestation was proposed by Wadler which could eliminate intermediate structures. However, this transformation algorithm was formulated only for first order functional programs. In this paper, it is shown how the original deforestation algorithm can be extended to deal with higher order functional programs. This extended algorithm is guaranteed to terminate only for expressions in which all functions are in a treeless form. It is shown how all function definitions can be generalised to this form so that the algorithm can be made to terminate for all programs. It is therefore argued that this algorithm is suitable for inclusion in an optimising compiler. i Contents 1 Introduction 1 2 Language 1 3 High...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	13 found	ParsCit 1.0