Kristian Nielsen, Morten Heine Sørensen  @ NUS Home/Search
Context Related
| diku.dk/diku/semantics/pa...D234.ps.gz Cached: PS.gz PS PDF Image Update Help From: diku.dk/researchgroups/to...1995 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Much attention has been given to the call-by-value continuation passing style (CBV CPS) translation as a tool in partial evaluation, but the call-by-name (CBN) CPS translation has not been investigated. We undertake a systematic investigation of the effect of CBN CPS in connection with partial evaluation and deforestation. First, we give an example where CBN CPS translation acts as a binding time improvement to achieve the effects of deforestation using partial evaluation. The same effect... (Update)
Context of citations to this paper: More
...e.g. 72, 15, 77, 43] Evaluation strategy. One can view a program transformer as an extension of an interpreter, e.g. [34, 31, 61, 74]. This implies that the transformer has an evaluation strategy that it inherits from the underlying interpreter. More concretely, the...
.... propagation (as opposed to constant propagation typical in partial evaluation and deforestation) For a more detailed comparison see [6, 19, 15]. Algorithm 3.5 (driving. 1. INPUT t 0 2 T , q 2 Q 2. LET T be the marked process tree with unmarked node labeled t 0 . 3. WHILE...
Cited by: More
CPS Translations and Applications: The Cube and Beyond - Barthe (1996) (Correct)
Better Consumers for Program Specializations - Chin, Khoo (1996) (Correct)
Proving the Correctness of Recursion-Based Automatic Program.. - Sands (1996) (Correct)
Active bibliography (related documents): More All
0.5: An Algorithm of Generalization in Positive Supercompilation - Sørensen, Glück (1995) (Correct)
0.2: A Constraint-based Partial Evaluator for Functional - Logic Programs And (Correct)
0.2: A Constraint-based Partial Evaluator for Functional Logic.. - Lafave (1998) (Correct)
Similar documents based on text: More All
1.1: Similix 5.0 Manual - Bondorf (1993) (Correct)
0.5: Call-By-Push-Value: A Subsuming Paradigm - Levy (1999) (Correct)
0.5: The sigma-Semantics: A Comprehensive Semantics for Functional.. - Chitil (1996) (Correct)
Related documents from co-citation: More All
8: Deforestation: transforming programs to eliminate trees - Wadler - 1990
8: a better support of static data flow - Consel, Danvy
7: The essence of compiling with continuations - Flanagan, Sabry et al.
BibTeX entry: (Update)
K. Nielsen and M.H. Sørensen. Call-by-name CPS-translation as a binding-time improvement. In A. Mycroft, editor, Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 296--313. Springer-Verlag, 1995. 4-29 http://citeseer.comp.nus.edu.sg/176117.html More
@misc{ nielsen95callbyname,
author = "K. Nielsen and M. Sorensen",
title = "Call-by-name CPS-translation as a binding-time improvement",
text = "K. Nielsen and M.H. Sørensen. Call-by-name CPS-translation as a binding-time
improvement. In A. Mycroft, editor, Static Analysis Symposium, volume 983
of Lecture Notes in Computer Science, pages 296--313. Springer-Verlag, 1995.
4-29",
year = "1995",
url = "citeseer.comp.nus.edu.sg/176117.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
158 Reasoning about Programs in Continuation-Passing Style - Sabry, Felleisen - 1993
83 Automatic Autoprojection of Higher-Order Recursive Equations (context) - Bondorf, Danvy - 1990
76 a Better Support of Static Data Flow - Consel, Danvy - 1991
57 The Concept of a Supercompiler (context) - Turchin - 1986
55 Call-by-Value and the -Calculus (context) - Plotkin - 1975
48 Automatic Online Partial Evaluation (context) - Weise, Conybeare et al. - 1991
41 Continuation-Based Partial Evaluation - Lawall, Danvy - 1994
39 Improving Binding Times without Explicit CPS-Conversion (context) - Bondorf - 1992
38 Self-Applicable Partial Evaluation (context) - Bondorf - 1990
38 Partial Deduction and Driving are Equivalent - Gluck, Sorensen - 1994
35 CPS-Transformation After Strictness Analysis - Danvy, Hatcliff - 1992
26 The Essence of Program Transformation by Partial Evaluation .. (context) - Jones - 1994
19 Higher Order Deforestation - Hamilton - 1994
17 Deforestation for Higher-Order functions - Marlow, Wadler - 1992
15 Improving CPS-Based Partial Evaluation: Writing Cogen by Han.. - Bondorf, Dussart - 1994
14 Semantics-Directed Compilation of Non-Linear Patterns - Danvy - 1991
10 Total Correctness and Improvement in the Transformation of R.. (context) - Sands - 1995
10 and Generalized Partial Computation (context) - Sorensen, Gluck et al. - 1994
7 Department of Computer Science (context) - Hatcliff, Danvy et al. - 1995
2 Generating Transformers for Deforestation and Driving (context) - Gluck, Jorgensen - 1994
1 Proving Program Transformers Correct by Program Transformati.. (context) - Dussart - 1995
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/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 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.