(Enter summary)
Abstract: We introduce a positive supercompiler, a version of Turchin's supercompiler maintaining only positive information during transformation, and using folding without generalization. The positive supercompiler can also be regarded as a variant of Wadler's deforestation maintaining an increased amount of information. We compare our algorithm to deforestation and, in less detail, to partial evaluation, Turchin's supercompiler, generalized partial computation (GPC), and partial deduction by... (Update)
Similar documents based on text: More All
0.7: Towards Unifying Partial Evaluation, Deforestation.. - Sĝrensen, Glück, Jones (1994)
(Correct)
0.7: On Perfect Supercompilation - Secher, Sĝrensen (1999)
(Correct)
0.6: Program Transformation System Based on Generalized Partial.. - Futamura, Konishi (2002)
(Correct)
Related documents from co-citation: More All
3: The concept of a supercompiler (context) - Turchin - 1986
2: A note on deforesting parameters of accumulating maps (context) - Kakehi, Gl et al. - 2001
2: arken von Teilklassen primitiv{rekursiver Programmschemata (context) - uhnemann - 1997
BibTeX entry: (Update)
M.H. Srensen, R. Gluck, and N.D. Jones. A positive supercompiler. J. Funct. Prog., 6:811-838, 1996. http://citeseer.ist.psu.edu/rensen93positive.html More
@article{ sorensen96positive,
author = {Morten Heine S{\o}rensen and
Robert Gl{\"u}ck and
Neil D. Jones},
title = {A Positive Supercompiler.},
journal = {Journal of Functional Programming},
volume = {6},
number = {6},
year = {1996},
pages = {811-838},
url = {citeseer.ist.psu.edu/rensen93positive.html} }
Citations (may not include all citations):
385
A transformation system for developing recursive programs
- Burstall, Darlington - 1977
347
Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
324
Deforestation: transforming programs to eliminate trees
- Wadler - 1990
224
Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
169
A call-by-need lambda calculus
- Ariola, Felleisen et al. - 1995
114
A natural semantics for lazy evaluation
- Launchbury - 1993
76
a better support of static data flow
- Consel, Danvy - 1991
57
The concept of a supercompiler (context) - Turchin - 1986
55
Safe fusion of functional expressions (context) - Chin - 1992
38
Self-applicable partial evaluation (context) - Bondorf - 1990
37
Partial evaluation of pattern matching in strings
- Consel, Danvy - 1989
37
Occam's razor in metacomputation: the notion of a perfect pr.. (context) - Gluck, Klimov - 1993
35
Generalized partial computation (context) - Futamura, Nogi - 1988
33
Lecture Notes in Computer Science (context) - Compiler, Jones et al. - 1982
30
Unfolding - Definition - Folding (context) - Proietti, Pettorossi - 1991
30
The algorithm of generalization in the supercompiler (context) - Turchin - 1988
30
An algorithm of generalization in positive supercompilation (context) - Sorensen, Gluck - 1995
29
Automatic call unfolding in a partial evaluator (context) - Sestoft - 1988
28
When will deforestation stop (context) - Ferguson, Wadler - 1988
27
Total correctness by local improvement in program transforma..
- Sands
26
The essence of program transformation by partial evaluation .. (context) - Jones - 1994
26
Partial evaluation of pattern matching in constraint logic p.. (context) - Smith - 1991
24
Proving the correctness of recursion-based automatic program..
- Sands
24
Efficient compilation of pattern-matching (context) - Wadler - 1987
21
Listlessness is better than laziness (context) - Wadler - 1984
15
A system for assisting program transformation (context) - Feather - 1982
14
A grammar-based data-flow analysis to stop deforestation (context) - Sorensen
13
Call-by-name CPS-translation as a binding-time improvement
- Nielsen, Sorensen - 1995
13
Generating transformers for deforestation and supercompilati..
- Gluck, Jorgensen - 1994
13
Generalized partial computation for a lazy functional langua.. (context) - Takano - 1991
11
A supercompiler system based on the language Refal (context) - Turchin - 1979
10
Application of metasystem transition to function inversion a.. (context) - Gluck, Turchin - 1990
6
Semantic definitions in Refal and automatic production of co.. (context) - Turchin - 1980
5
Program evaluation and generalized partial computation (context) - Futamura - 1988
5
Compile-time optimisation of storage usage in lazy functiona.. (context) - Hamilton - 1993
4
An operational theory of positive information propagation (context) - Sorensen
2
Speedup analysis in partial evaluation (context) - Andersen, Gomard - 1992
1
In Partial Evaluation and Mixed Computation, Bjĝrner D., Ers.. (context) - Evaluation, Bj et al. - 1993
1
International Symposium (context) - Programming, the - 1995
1
In ACM Symposium on Lisp and Functional Programming (context) - on, Functional et al. - 1982
1
Towards unifying deforestation (context) - Sorensen, Gluck et al. - 1994
1
An introduction to partial deduction (context) - Logic, Computation et al. - 1992
1
Automatic program specialization: a re-examination from basi.. (context) - thesis, Stirling - 1988
1
Introduction to Functional Programming (context) - Supercompiler, Wadler - 1988
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1996.html): More
What Not to Do When Writing an Interpreter for Specialisation - Jones (1996)
(Correct)
Controlling Conjunctive Partial Deduction of.. - Glück, Jĝrgensen.. (1996)
(Correct)
Bootstrapping Higher-Order Program Transformers from.. - Sperber, Glück, Thiemann (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