Deforestation for Higher-Order Functional Programs

Deforestation for Higher-Order Functional Programs (1995)

by Simon David Marlow

Citations:

17 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Deforestation for Higher-Order Functional Programs	user correction - Legacy Corrections
AUTHOR NAME	Simon David Marlow	SVM HeaderParse 0.1
AUTHOR AFFIL	; Computing Science at the University of Glasgow	SVM HeaderParse 0.2
AUTHOR ADDR	; c fl Simon Marlow 1995	SVM HeaderParse 0.1
ABSTRACT	Functional programming languages are an ideal medium for program optimisations based on source-to-source transformation techniques. Referential transparency affords opportunities for a wide range of correctness-preserving transformations leading to potent optimisation strategies. This thesis builds on deforestation, a program transformation technique due to Wadler that removes intermediate data structures from first-order functional programs. Our contribution is to reformulate deforestation for higher-order functional programming languages, and to show that the resulting algorithm terminates given certain syntactic and typing constraints on the input. These constraints are entirely reasonable, indeed it is possible to translate any typed program into the required syntactic form. We show how this translation can be performed automatically and optimally. The higher-order deforestation algorithm is transparent. That is, it is possible to determine by examination of the source program w...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	54 found	ParsCit 1.0