(Enter summary)
Abstract: . A partial evaluator, given a program and a known "static"
part of its input data, outputs a specialised or residual program in which
computations depending only on the static data have been performed in
advance.
Ideally the partial evaluator would be a "black box" able to extract
nontrivial static computations whenever possible; which never fails to
terminate; and which always produces residual programs of reasonable
size and maximal efficiency, so all possible static computations have been... (Update)
Cited by: More
A Constraint-based Partial Evaluator for Functional - Logic Programs And
(Correct)
DSL Implementation in MetaOCaml, Template Haskell, and.. - Czarnecki, O'Donnell..
(Correct)
Transformation by Interpreter Specialisation - Jones (2004)
(Correct)
Active bibliography (related documents): More All
0.5: Improving CPS-Based Partial Evaluation: Writing Cogen by Hand - Bondorf, Dussart (1994)
(Correct)
0.5: The Expressive Power of Higher-order Types or, Life without CONS - Jones
(Correct)
0.1: An Automatic Program Generator for Multi-Level Specialization - Glück, Jørgensen (1997)
(Correct)
Similar documents based on text: More All
0.2: BTA Algorithms to Ensure Termination of Off-line Partial.. - Glenstrup, Jones (1996)
(Correct)
0.2: ESSLLI 2000 Lecture Notes: Computability and Complexity - From Programming Perspective (2000)
(Correct)
0.2: Unknown -
(Correct)
Related documents from co-citation: More All
20: Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
10: Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
9: A general approach for run-time specialization and its application to C
- Consel, Noel - 1996
BibTeX entry: (Update)
N. Jones. What not to do when writing an interpreter for specialization. In Partial Evaluation, LNCS nr. 1110, pages 216--237. Springer Verlag, 1996. http://citeseer.ist.psu.edu/jones96what.html More
@inproceedings{ neil96what,
author = "Jones, Neil D.",
title = "What Not to Do When Writing an Interpreter for Specialisation",
booktitle = "Partial Evaluation",
volume = "1110",
publisher = "Springer-Verlag",
editor = "Danvy, Olivier and Gl{\"u}ck, Robert and Thiemann, Peter",
pages = "216--237",
year = "1996",
url = "citeseer.ist.psu.edu/jones96what.html" }
Citations (may not include all citations):
638
Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
224
Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
96
Automatic autoprojection of recursive equations with global ..
- Bondorf, Danvy - 1991
57
The concept of a supercompiler (context) - Turchin - 1986
35
New insights into partial evaluation: The Schism experiment (context) - Consel - 1988
28
Partially static structures in a self-applicable partial eva.. (context) - Mogensen - 1988
23
Separating binding times in language specifications (context) - Mogensen - 1989
22
The Mixtus approach to automatic partial evaluation of full .. (context) - Sahlin - 1990
10
BTA Algorithms to ensure termination of offline partial eval..
- Jones, Glenstrup - 1996
2
MA: Allyn and Bacon (context) - Schmidt, Semantics - 1986
2
Partial evaluation of polymorphically typed functional langu.. (context) - De Niel, Bevers et al. - 1991
1
Partial Evaluation and Semantics-based Program Manipulation (context) - Gallagher, logic et al. - 1993
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/1996.html): More
Controlling Conjunctive Partial Deduction of.. - Glück, Jĝrgensen.. (1996)
(Correct)
Bootstrapping Higher-Order Program Transformers from.. - Sperber, Glück, Thiemann (1996)
(Correct)
Generalized Dominators for Structured Programs - Alstrup, Lauridsen, Thorup (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