H. Seidl, M.H. Sørensen  Home/Search
Context Related
| diku.dk/diku/semantics/pa...D337.ps.gz informatik.unitri...eforestlong.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: This paper is about Wadler's deforestation [17,66,68], an algorithm eliminating intermediate data structures from first-order functional programs in which (i) no definition contains an argument which is not a variable; (ii) no definition contains a selector which is not a variable; (iii) no definition nor the main term contains a non-linear variable. We call a program treeless if it satisfies (i-ii), and linear if it satisfies (iii). In a treeless program the right hand sides do not construct... (Update)
Context of citations to this paper: More
...analyzing sets of values for ML programs. Similar use of constraints has been studied for stopping deforestation for higherorder programs [49]. Our extension adds two constraints productions for each lambda expression and uses two additional rules for simplification; it is not...
...programs and Scheme programs, respectively. Use of constraints has also been studied for stopping deforestation for higher order programs [53]. Our method is described here for an untyped language, but the analysis results provide an important kind of type information; the...
Cited by: More
Declarative Program Transformation: A Deforestation.. - Correnson, Duris.. (1999) (Correct)
Driving-based Program Transformation in Theory and Practice - Secher (2002) (Correct)
Declarative Program Transformation: a Deforestation.. - Correnson, Duris.. (1999) (Correct)
Similar documents (at the sentence level):
20.9%: Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (Correct)
Active bibliography (related documents): More All
1.4: A Constraint-based Partial Evaluator for Functional Logic.. - Lafave (1998) (Correct)
1.4: A Constraint-based Partial Evaluator for Functional - Logic Programs And (Correct)
0.6: A Positive Supercompiler - Sørensen, Glück, Jones (1993) (Correct)
Similar documents based on text: More All
0.5: A Grammar-based Data-flow Analysis to Stop Deforestation - Sørensen (1994) (Correct)
0.5: A New Means of Ensuring Termination of Deforestation With an.. - Sørensen (1993) (Correct)
0.5: Deforestation for Higher-Order Functional Programs - Marlow (1995) (Correct)
Related documents from co-citation: More All
7: Deforestation: transforming programs to eliminate trees - Wadler - 1990
6: Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981
4: A fold for all seasons - Sheard, Fegaras - 1993
BibTeX entry: (Update)
H. Seidl and M. H. Sørensen. Constraints to stop deforestation. Sci. Comput. Program., 32:73--107, 1998. http://citeseer.ist.psu.edu/article/seidl98constraint.html More
@article{ seidl98constraints,
author = "H. Seidl and M. H. S{\o}rensen",
title = "Constraints to stop deforestation",
journal = "Science of Computer Programming",
volume = "32",
number = "1--3",
pages = "73--107",
year = "1998",
url = "citeseer.ist.psu.edu/article/seidl98constraint.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 intermedia.. - Wadler - 1990
324 Deforestation: Transforming programs to eliminate trees - Wadler - 1988
206 Why functional programming matters - Hughes - 1990
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
169 A call-byneed 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
143 Theorems for free - Wadler - 1989
131 A fold for all seasons - Sheard, Fegaras - 1993
127 Control-flow analysis in scheme (context) - Shivers - 1988
126 Type inference with polymorphic recursion - Henglein - 1993
96 Automatic autoprojection of recursive equations - Bondorf - 1991
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
74 Replacing function parameters by global variables (context) - Sestoft - 1989
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
46 Infinitary control flow analysis: a collecting semantics for.. - Nielson, Nielson - 1997
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 Global control for partial deduction through characteristic .. (context) - Leuschel, Martens - 1996
32 Automatic Methods for Program Transformation (context) - Chin - 1990
30 An algorithm of generalization in positive supercompilation (context) - Sorensen, Gluck - 1995
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 - 1996
24 Proving the correctness of recursion-based automatic program.. - Sands - 1995
23 Finiteness analysis (context) - Holst - 1991
22 Department of Computer Science (context) - Hamilton, deforestation et al. - 1995
21 Listlessness is better than laziness (context) - Wadler - 1984
21 Cheap Deforestation for Non-strict Functional Languages - Gill - 1996
21 ACM Transactions on Programming Languages and Systems (context) - Feather, for et al. - 1982
19 Higher order deforestation - Hamilton - 1996
17 Deforestation for higher-order 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
14 Constraints to stop higher-order deforestation - Seidl, Sorensen - 1997
13 Call-by-name CPS-translation as a binding-time improvement - Nielsen, Sorensen - 1995
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 Deforestation for Higher-Order Functional Languages (context) - Marlow - 1996
7 Listlessness is better than lazyness II: Composing listless .. (context) - Wadler - 1985
7 Integer constraints to stop deforestation - Seidl - 1996
6 Transforming programs to eliminate intermediate structures (context) - Hamilton, Jones - 1991
5 Generalising deforestation to all first-order functional pro.. (context) - Chin - 1991
5 Optimizing algebraic programs - Sheard, Fegaras - 1994
5 Higher-order removal transformation technique for functional.. (context) - Chin, Darlington - 1992
5 Least solutions of equations over N (context) - Seidl - 1994
5 Compile-Time Optimisations of Storage Usage in Lazy Function.. (context) - Hamilton - 1993
4 Transformations of FP program schemes (context) - Kierburtz, Schultis - 1981
4 Applicative style programming (context) - Wadler - 1981
4 Extending first order deforestation - Hamilton - 1995
3 IEEE Transations on Software Engineering (context) - Manna, Waldinger et al. - 1979
1 Program inprovement by internal specialization (context) - Scherlis - 1981
1 Least and greatest solutions of equations over N (context) - Seidl - 1996
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)
Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (Correct)
CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996) (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