Deforestation for Higher-Order Functions

Simon Marlow, Philip Wadler

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Deforestation is an automatic transformation scheme for functional programs which attempts to remove unnecessary intermediate data structures. The algorithm presented here is a variant of the original, adapted for a higher order language. A detailed description of how this may be implemented in an optimising compiler is also given.
Original languageEnglish
Title of host publicationFunctional Programming, Glasgow 1992
EditorsJohn Launchbury, Patrick Sansom
PublisherSpringer London
Pages154-165
Number of pages12
ISBN (Print)978-3-540-19820-8
DOIs
Publication statusPublished - 1993

Publication series

NameWorkshops in Computing

Fingerprint

Dive into the research topics of 'Deforestation for Higher-Order Functions'. Together they form a unique fingerprint.

Cite this