Constraints to Stop Higher-Order Deforestation

Constraints to Stop Higher-Order Deforestation (1997)

Cached

Download Links

[www-sop.inria.fr]
[ftp.diku.dk]

Other Repositories/Bibliography

DBLP

by H. Seidl , M.H. Sørensen

Venue:	In 24th ACM Symposium on Principles of Programming Languages
Citations:	11 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Constraints to Stop Higher-Order Deforestation	INFERENCE
AUTHOR NAME	H. Seidl	user correction - Legacy Corrections
AUTHOR AFFIL	FB IV- Informatik	user correction - Legacy Corrections
AUTHOR ADDR	Universitat Trier, D-54286 Trier, Germany	user correction - Legacy Corrections
AUTHOR NAME	M.H. Sørensen	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science, University of Copenhagen	user correction - Legacy Corrections
AUTHOR ADDR	Universitetsparken 1, DK-2100 Copenhagen, Denmark	user correction - Legacy Corrections
ABSTRACT	Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all programs. Several techniques to ensure termination of deforestation on all first-order programs are known, but a technique for higher-order programs was only recently introduced by Hamilton, and elaborated and implemented in the Glasgow Haskell compiler by Marlow. We introduce a new technique for ensuring termination of deforestation on all higher-order programs that allows useful transformation steps prohibited in Hamilton's and Marlowe's techniques. 1 Introduction Lazy, higher-order, functional programming languages lend themselves to a certain style of programming which uses intermediate data structures [28]. Example 1 Consider the following program. letrec a = x; y:case x of [] ! y (h : t) ! h : a t y in u; v; w: a (a u v) w The term u; v; w:a (a u v) w appends the three lists u, v, and w. Appending u and v ...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	In 24th ACM Symposium on Principles of Programming Languages	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	400--413	INFERENCE
CITATIONS	53 found	ParsCit 1.0