(Enter summary)
Abstract: Source-program modifications can make a partial evaluator
yield dramatically better results. For example, eta-redexes can preserve
static data flow by acting as an interface between values and contexts. (Update)
Similar documents (at the sentence level):
28.0%: The Essence of Eta-Expansion in Partial Evaluation - Danvy, Malmkjær, Palsberg (1995)
(Correct)
11.7%: Eta-Expansion does the Trick - Danvy, Malmkjær, Palsberg (1996)
(Correct)
Active bibliography (related documents): More All
0.3: Design, Analysis and Reasoning about Tools: Abstracts from.. - Nielson, (Ed.) (1993)
(Correct)
0.2: Analysis and Efficient Implementation of Functional Programs - Sestoft (1991)
(Correct)
0.2: A Computational Formalization for Partial Evaluation - Hatcliff, Danvy (1996)
(Correct)
Similar documents based on text: More All
0.4: Compiling Actions by Partial Evaluation, Revisited - Danvy, Rhiger (1998)
(Correct)
0.3: Implementing Memoization for Partial Evaluation - Thiemann (1997)
(Correct)
0.3: A Computational Formalization for Partial Evaluation.. - Hatcliff, Danvy (1997)
(Correct)
BibTeX entry: (Update)
@inproceedings{ palsberg98etaredexes,
author = "Jens Palsberg",
title = "Eta-Redexes in Partial Evaluation",
booktitle = "Partial Evaluation",
pages = "356-366",
year = "1998",
url = "citeseer.ist.psu.edu/595664.html" }
Citations (may not include all citations):
638
Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
206
Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
184
Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
176
Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
138
Typed closure conversion
- Minamide, Morrisett et al. - 1996
131
Set Based Program Analysis
- Heintze - 1992
122
Type-directed partial evaluation
- Danvy - 1996
83
Automatic autoprojection of higher order recursive equations (context) - Bondorf - 1991
74
Replacing function parameters by global variables (context) - Sestoft - 1989
70
Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
55
call-by-value and the #-calculus (context) - Plotkin - 1975
51
Two-Level Functional Languages (context) - Nielson, Nielson - 1992
50
Artificial Intelligence Laboratory (context) - Jr, for et al. - 1978
49
Specifying the correctness of binding-time analysis (context) - Wand - 1993
43
An inverse of the evaluation functional for typed #-calculus (context) - Berger, Schwichtenberg - 1991
41
Automatic program specialization: A re-examination from basi.. (context) - Jones - 1988
40
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
31
Correctness of binding-time analysis
- Palsberg - 1993
29
The essence of etaexpansion in partial evaluation
- Danvy, Malmkjr et al. - 1994
15
Improving CPS-based partial evaluation: Writing cogen by han..
- Bondorf, Dussart - 1994
15
Constructor specialization
- Mogensen - 1993
12
ACM Transactions on Programming Languages and Systems (context) - Danvy, Malmkjr et al. - 1996
11
Partial evaluation of general parsers (context) - Mossin - 1993
6
Generating action compilers by partial evaluation
- Bondorf, Palsberg - 1993
4
Program Analysis Matters (context) - Gomard - 1991
Documents on the same site (http://www.cs.purdue.edu/homes/palsberg/publications.html): More
Safety Analysis versus Type Inference for Partial Types - Palsberg, Schwartzbach (1992)
(Correct)
Comparing Flow-based Binding-time Analyses - Palsberg (1995)
(Correct)
Normal Forms have Partial Types - Palsberg (1993)
(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