H. Seidl, M.H. Sørensen  Home/Search
Context Related
| diku.dk/diku/semantics/pa...D302.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: diku.dk/researchgroups/to...1997 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Wadler's deforestation algorithm removes intermediate data structures from functional programs. To be appropriate for inclusion in a compiler, deforestation must terminate on all programs. Several techniques exist to ensure termination of deforestation on all first-order programs, but a technique for higher-order programs was only recently introduced by Hamilton and later Marlow. We present a new technique for ensuring termination of deforestation on all higher-order programs that allows useful ... (Update)
Context of citations to this paper: More
...for an intermediate data structure. In recent years, many attempts have been put forward to automate such fusion calculations [SF93,GLPJ93,SS97,HIT96]. Most current attempts are restricted to using equational de nitions during transformation. For example, the deforestation...
Cited by: More
A Constraint-based Partial Evaluator for Functional - Logic Programs And (Correct)
Fusion in Practice - Diederik Van Arkel (2003) (Correct)
Optimising the Memory Management of Higher-Order Functional.. - Mohnen (1997) (Correct)
Similar documents (at the sentence level):
50.3%: Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (Correct)
38.1%: Constraints to Stop Deforestation - Seidl, Sørensen (1998) (Correct)
Active bibliography (related documents): More All
1.3: A Constraint-based Partial Evaluator for Functional Logic.. - Lafave (1998) (Correct)
0.5: A New Means of Ensuring Termination of Deforestation - Sørensen (1993) (Correct)
0.5: A Positive Supercompiler - Sørensen, Glück, Jones (1993) (Correct)
Similar documents based on text: More All
0.5: A New Means of Ensuring Termination of Deforestation With an.. - Sørensen (1993) (Correct)
0.5: A Grammar-based Data-flow Analysis to Stop Deforestation - Sørensen (1994) (Correct)
0.5: Deforestation for Higher-Order Functional Programs - Marlow (1995) (Correct)
Related documents from co-citation: More All
13: Deforestation: transforming programs to eliminate trees - Wadler - 1990
7: Safe fusion of functional expressions II: Further improvements (context) - Chin - 1994
7: A short cut to deforestation - Gill, Launchbury et al. - 1993
BibTeX entry: (Update)
H. Seidl and M.H. Sørensen. Constraints to stop higher-order deforestation. In 24th ACM Symp. on Principles of Programming Languages, pages 400--413, 1997. http://citeseer.ist.psu.edu/article/seidl97constraint.html More
@inproceedings{ seidl97constraints,
author = "Helmut Seidl and Morten Heine Sorensen",
title = "Constraints to Stop Higher-Order Deforestation",
booktitle = "Symposium on Principles of Programming Languages",
pages = "400-413",
year = "1997",
url = "citeseer.ist.psu.edu/article/seidl97constraint.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
382 Lambda calculi with types - Barendregt - 1992
324 Deforestation: Transforming programs to eliminate trees - Wadler - 1988
206 Why functional programming matters - Hughes - 1990
169 A call-by-need lambda-calculus - Ariola, Felleisen et al. - 1995
165 Set-based analysis of ML programs (context) - Heintze - 1994
161 A short cut to deforestation - Gill, Launchbury et al. - 1993
160 The principal type scheme of an object in combinatory logic (context) - Hindley - 1969
131 A fold for all seasons - Sheard, Fegaras - 1993
126 Type inference with polymorphic recursion - Henglein - 1993
88 A type system equivalent to flow analysis - Palsberg, O'Keefe - 1995
79 Polymorphic type schemes and recursive definitions (context) - Mycroft - 1984
79 Shortcut deforestation in calculational form - Takano, Meijer - 1995
67 ACM Transactions on Programming Languages and Systems (context) - Palsberg, in - 1995
55 Safe fusion of functional expressions (context) - Chin - 1992
53 Using circular programs to eliminate multiple traversals of .. (context) - Bird - 1984
45 Warm fusion: Deriving build-catas from recursive definitions - Launchbury, Sheard - 1995
44 Total correctness by local improvement in the transformation.. - Sands - 1996
42 Improving programs which recurse over multiple inductive str.. - Fegaras, Sheard et al. - 1994
38 Self-Applicable Partial Evaluation (context) - Bondorf - 1990
37 Flow analysis of lazy higher-order functional programs (context) - Jones - 1987
32 Automatic Methods for Program Transformation (context) - Chin - 1990
29 Automatic call unfolding in a partial evaluator (context) - Sestoft - 1988
29 An experimental program transformation and synthesis system (context) - Darlington - 1981
28 Safe fusion of functional expressions II: Further improvemen.. (context) - Chin - 1994
28 When will deforestation stop (context) - Ferguson, Wadler - 1988
27 Total correctness by local improvement in program transforma.. - Sands - 1995
24 Proving the correctness of recursion-based automatic program.. - Sands - 1995
24 Proving the correctness of recursion-based automatic program.. - Sands - 1996
21 ACM Transactions on Programming Languages and Systems (context) - Feather, for et al. - 1982
21 Cheap Deforestation for Non-strict Functional Languages - Gill - 1996
21 Listlessness is better than laziness (context) - Wadler - 1984
19 Higher order deforestation - Hamilton - 1996
17 Deforestation for higherorder functions - Marlow, Wadler - 1992
16 Experiments with a supercompiler (context) - Turchin, Nirenberg et al. - 1982
14 A grammar-based data-flow analysis to stop deforestation (context) - Sorensen - 1994
14 Extending deforestation for first order functional programs (context) - Hamilton, Jones - 1991
11 Cheap deforestation in practice: An optimiser for Haskell (context) - Gill, Jones - 1994
8 Fully lazy higher-order removal (context) - Chin - 1992
8 Better consumers for deforestation (context) - Chin, Khoo - 1995
7 Integer constraints to stop deforestation - Seidl - 1996
7 Deforestation for Higher-Order Functional Languages (context) - Marlow - 1996
7 Listlessness is better than lazyness II: Composing listless .. (context) - Wadler - 1985
6 Transforming programs to eliminate intermediate structures (context) - Hamilton, Jones - 1991
5 Generalising deforestation to all first-order functional pro.. (context) - Chin - 1991
5 Compile-Time Optimisations of Storage Usage in Lazy Function.. (context) - Hamilton - 1993
5 Least solutions of equations over N (context) - Seidl - 1994
5 Higher-order removal transformation technique for functional.. (context) - Chin, Darlington - 1992
4 Applicative style programming (context) - Wadler - 1981
4 Extending first order deforestation - Hamilton - 1995
4 Transformations of FP program schemes (context) - Kierburtz, Schultis - 1981
3 IEEE Transations on Software Engineering (context) - Manna, Waldinger et al. - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1997.html): More
A kappa-denotational semantics for Map Theory in ZFC + SI - Berline, Grue (1996) (Correct)
CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996) (Correct)
Higher-Order Value Flow Graphs - Mossin (1997) (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