Turchin's Supercompiler Revisited An operational theory of positive information propagation (1996)  (Make Corrections)  
Morten Heine Sørensen

 @ NUS   Home/Search   Context   Related

 
View or download:
diku.dk/diku/semantics/pa...D297.ps.gz
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  diku.dk/researchgroups/to...1994 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Turchin`s supercompiler is a program transformer that includes both partial evaluation and deforestation. Although known in the West since 1979, the essence of its techniques, its more precise relations to other transformers, and the properties of the programs that it produces are only now becomming apparent in the Western functional programming community. This thesis gives a new formulation of the supercompiler in familiar terms; we study the essence of it, how it achieves its effects, and its ... (Update)

Active bibliography (related documents):   More   All
1.9:   A New Means of Ensuring Termination of Deforestation - Sørensen (1993)   (Correct)
0.8:   Occam's Razor in Metacomputation: the Notion of a Perfect.. - Glück, Klimov (1993)   (Correct)
0.6:   A Grammar-based Data-flow Analysis to Stop Deforestation - Sørensen (1994)   (Correct)

Similar documents based on text:   More   All
0.8:   A Positive Supercompiler - Sørensen, Glück, Jones (1993)   (Correct)
0.6:   On Perfect Supercompilation - Secher, Sørensen (1999)   (Correct)
0.6:   A Roadmap to Metacomputation by Supercompilation - Glück, Sørensen (1996)   (Correct)

BibTeX entry:   (Update)

@misc{ rensen-turchins,
  author = "Morten Heine Sørensen",
  title = "Turchin's Supercompiler Revisited - An operational theory of positive information
    propagation",
  url = "citeseer.comp.nus.edu.sg/108990.html" }
Citations (may not include all citations):
324   Deforestation: Transforming Programs to Eliminate Trees - Wadler - 1988
258   Data Structures and Network Algorithms (context) - Tarjan - 1983
66   Views: A Way for Pattern-Matching to Cohabit with Data Abstr.. - Wadler - 1987
59   An Overview of Miranda (context) - Turner - 1990
57   The Concept of a Supercompiler (context) - Turchin - 1986
49   Specifying the Correctness of Binding-time Analysis (context) - Wand - 1993
48   Automatic Online Partial Evaluation (context) - Weise, Conybeare et al. - 1991
30   The Algorithm of Generalization in the Supercompiler (context) - Turchin - 1988
24   Efficient compilation of pattern-matching (context) - Wadler - 1987
23   Studies In Logic And The Foundations Of Mathematics (context) - Troelstra, van Dalen et al. - 1988
16   Experiments with a Supercompiler (context) - Turchin, Nirenberg et al. - 1982
14   Columbia University Press (context) - Turchin, of - 1977
14   A Grammar-Based Data-Flow Analysis to Stop Deforestation (context) - Sorensen - 1994
13   Generalized Partial Computation for a Lazy Functional Langua.. (context) - Takano - 1991
12   The Use of Metasystem Transition in Theorem Proving and Prog.. (context) - Turchin - 1980
10   Program Transformation by Supercompilation (context) - Turchin - 1986
7   Listlessness is Better than Lazyness II: Composing Listless .. (context) - Wadler - 1985
7   Equivalent Transformation of Recursive Functions Defined in .. (context) - Turchin - 1972
6   Semantic Definitions in Refal and Automatic Production of Co.. (context) - Turchin - 1980
6   Listlessness is Better than Lazyness: Lazy Evaluation and Ga.. (context) - Wadler - 1984
4   The Language REFAL---The Theory of Compilation and Metasyste.. (context) - Turchin - 1980
4   A Constructive Interpretation of the Full Set Theory (context) - Turchin - 1987
2   Miranda: A Non-strict Functional Language with Plymorphic Ty.. (context) - Turner - 1985
2   Program Transformation by Metasystem Transitions (context) - Turchin - 1993
2   Equivalent Transformation of REFAL programs (context) - Turchin - 1974
2   Basic Refal and Its Implementation on Computers (context) - Turchin - 1977
2   Refal: A Language for Linguistic Cybernetics (context) - Turchin - 1986
1   A New Means of Ensuring Termination with an Application to L.. (context) - Sorensen - 1993
1   To appear as Lecture Notes in Computer Science (context) - Sorensen, Gluck et al. - 1994
1   Effecient Tests for Top-Down Termination of Logical Rules (context) - Ullman, Van Gelder - 1988
1   A Supercompiler System Based on the Lnaguage Refal (context) - Turchin - 1979

Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1994.html):   More
Efficient Translation of External Input in a Dynamically Typed.. - Paige (1994)   (Correct)
Interprocedural DataflowAnalysis via Graph Reachability - Reps, Sagiv, Horwitz (1994)   (Correct)
Program Speedups in Theory and Practice - Jones (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.