Morten H. Sørensen, Robert Glück  Home/Search
Context Related
| diku.dk/diku/semantics/pa...D254.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...1995 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a termination technique for positive supercompilation, based on notions from term algebra. The technique is not particularily biased towards positive supercompilation, but also works for deforestation and partial evaluation. It appears to be well suited for partial deduction too. The technique guarantees termination, yet it is not overly conservative. Our technique can be viewed as an instance of Martens' and Gallagher's recent framework for global termination of partial... (Update)
Context of citations to this paper: More
...the possibility of nontermination during program transformation, e.g. homeomorphic embedding. Examples: S rensen, Gl uck, Leuschel [47, 65]. 6. Computer placed program annotations to guide transformation, e.g. binding time annotation [6, 14, 15, 31, 32, 41, 35, 73] After...
Cited by: More
Program Generation, Termination, and Binding-time Analysis - Jones, Glenstrup (2002) (Correct)
Active bibliography (related documents): More All
0.7: Partial Deduction and Driving are Equivalent - Glück, Sørensen (1994) (Correct)
0.5: Call-By-Name CPS-Translation as a Binding-Time Improvement - Nielsen, Sørensen (1995) (Correct)
0.5: A Positive Supercompiler - Sørensen, Glück, Jones (1993) (Correct)
Similar documents based on text: More All
0.5: Towards Unifying Partial Evaluation, Deforestation.. - Sørensen, Glück, Jones (1994) (Correct)
0.4: On Perfect Supercompilation - Secher, Sørensen (1999) (Correct)
0.4: A Roadmap to Metacomputation by Supercompilation - Glück, Sørensen (1996) (Correct)
BibTeX entry: (Update)
Morten Heine S rensen and Robert Gluck. An algorithm of generalization in positive supercompilation. In J.W. Lloyd, editor, Logic Programming: Proceedings of the 1995 International Symposium, pages 465-479. MIT Press, 1995. http://citeseer.ist.psu.edu/heine95algorithm.html More
@inproceedings{ sorensen95algorithm,
author = "M. Heine S{\o}rensen and R. Gl{\"u}ck",
title = "An algorithm of generalization in positive supercompilation",
editor = "J.W. Lloyd",
booktitle = "Logic Programming: Proceedings of the 1995 International Symposium",
pages = "465-479",
publisher = "MIT Press",
year = "1995",
url = "citeseer.ist.psu.edu/heine95algorithm.html" }
Citations (may not include all citations):638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
324 Deforestation: Transforming Programs to Eliminate Trees - Wadler - 1990
224 Partial Evaluation in Logic Programming (context) - Lloyd, Shepherdson - 1991
121 Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud et al. - 1992
82 Tutorial on Specialisation of Logic Programs (context) - Gallagher - 1993
58 Ensuring Global Termination of Partial Deduction while Allow.. - Martens, Gallagher - 1995
57 The Concept of a Supercompiler (context) - Turchin - 1986
44 Efficient Tests for Top-Down Termination of Logical Rules (context) - Ullman, Van Gelder - 1988
42 Termination Proofs for Logic Programs (context) - Plumer - 1990
38 Loop Checking in Partial Deduction (context) - Bol - 1993
38 A General Criterion for Avoiding Infinite Unfolding During P.. (context) - Bruynooghe, De Schreye et al. - 1992
38 Partial Deduction and Driving are Equivalent - Gluck, Sorensen - 1994
37 Occam's Razor in Metacomputation: the Notion of a Perfect Pr.. (context) - Gluck, Klimov - 1993
29 An Introduction to Partial Deduction (context) - Komorowski - 1992
26 Partial Evaluation of Pattern Matching in Constraint Logic P.. (context) - Smith - 1991
26 The Essence of Program Transformation by Partial Evaluation .. (context) - Jones - 1994
23 Sound and Complete Partial Deduction with Unfolding Based on.. (context) - Martens, De Schreye et al. - 1994
18 Towards Unifying Partial Evaluation (context) - Sorensen, Gluck et al. - 1994
13 Call-by-Name CPS-Translation as a Binding-Time Improvement - Nielsen, Sorensen - 1995
12 The Use of Metasystem Transition in Theorem Proving and Prog.. (context) - Turchin - 1980
10 Application of Metasystem Transition to Function Inversion a.. (context) - Gluck, Turchin - 1990
7 Equivalent Transformations of Recursive Functions Defined in.. (context) - Turchin - 1972
4 An Operational Theory of Positive Information Propagation (context) - Sorensen, Revisited - 1994
2 Generating Transformers for Deforestation and Driving (context) - Gluck, Jorgensen - 1994
1 Symposium on Lisp and Functional Programming (context) - Turchin, Nirenberg et al. - 1982
1 Partial Evaluation and Mixed Computation (context) - Turchin, of et al. - 1988
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1995.html): More
Combinatory Reduction Systems with Explicit Substitution - Rose (1996) (Correct)
What is a "Pointer Machine"? - Ben-Amram (1995) (Correct)
Higher-Order Expression Procedures - Sands (1995) (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