Andrew John Gill  Home/Search
Context Related
| dcs.gla.ac.uk/fp/authors...thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: hypatia.dcs.qmw...tional.implemen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In functional languages intermediate data structures are often used as glue to connect separate parts of a program together. Deforestation is the process of automatically removing intermediate data structures. In this thesis we present and analyse a new approach to deforestation. This new approach is both practical and general. We analyse in detail the problem of list removal rather than the more general problem of arbitrary data structure removal. This more limited scope allows a complete... (Update)
Context of citations to this paper: More
...enable the rule to apply. The most important are inlining of functions and b reduction. In some cases it also relies on arity analysis [Gil96]. In this paper we will explicitly write out in each step what other transformations are used to enable fusion in order to show that...
Cited by: More
Fusion in Practice - Diederik Van Arkel (2003) (Correct)
Comparison of Deforestation Techniques for Functional Programs.. - Kühnemann (Correct)
Using Circular Programs to Deforest in Accumulating Parameters - Voigtländer (2004) (Correct)
Similar documents based on text: More All
0.5: Deforestation of Functional Programs through Type Inference - Chitil (2000) (Correct)
0.3: Deforestation for Higher-Order Functional Programs - Marlow (1995) (Correct)
0.3: Type Inference Builds a Short Cut to Deforestation - Chitil (1999) (Correct)
Related documents from co-citation: More All
18: Deforestation: transforming programs to eliminate trees - Wadler - 1990
17: A short cut to deforestation - Gill, Launchbury et al. - 1993
11: A transformation system for developing recursive programs - Burstall, Darlington - 1977
BibTeX entry: (Update)
AJ Gill [Jan 1996], "Cheap deforestation for non-strict functional languages," PhD thesis, Department of Computing Science, Glasgow University. http://citeseer.ist.psu.edu/gill96cheap.html More
@phdthesis{ gill96cheap,
author = "Gill, Andrew",
title = "{C}heap {D}eforestation for {N}on-strict {F}unctional {L}anguages",
year = "1996",
url = "citeseer.ist.psu.edu/gill96cheap.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://hypatia.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/functional.implemen.html): More
Incremental Recompilation for Standard ML of New Jersey - Harper, Lee, Pfennig, Rollins (1994) (Correct)
Statistics on Storage Management in a Lazy Functional.. - Wild, Glaser, Hartel (1992) (Correct)
Experiments with strict STG code - Denis Howe (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC