(Enter summary)
Abstract: this paper, we illustrate that the computational meta-language can be a useful
framework for partial evaluation. It allows a clear distinction between static computation
steps (to be performed at specialization time) and dynamic computation steps (to be
residualized at specialization time and performed at run time). Moreover, it allows an
evaluation-order independent view of binding-time analysis and program specialization.
To this end, we present a PCF-like version of the computational... (Update)
Cited by: More
A Monadic Approach for Avoiding Code Duplication when .. - Swadi, Taha.. (2006)
(Correct)
Staging Dynamic Programming Algorithms - Kedar Swadi Kswadi (2005)
(Correct)
Closed Types as a Simple Approach to Safe Imperative.. - Calcagno, Moggi, Taha (2000)
(Correct)
Similar documents (at the sentence level):
63.5%: A Computational Formalization for Partial Evaluation.. - Hatcliff, Danvy (1997)
(Correct)
58.5%: A Computational Formalization for Partial Evaluation - Hatcliff, Danvy (1996)
(Correct)
Active bibliography (related documents): More All
0.5: Two for the Price of One: Composing Partial Evaluation and.. - Sperber, Thiemann (1997)
(Correct)
0.4: Mechanically Verifying the Correctness of an Offline Partial.. - Hatcliff (1995)
(Correct)
0.4: Sound Specialization in the Presence of Computational Effects - Lawall, Thiemann (1997)
(Correct)
Similar documents based on text: More All
0.5: Binding Time Analysis: A New PERspective - Hunt, Sands (1991)
(Correct)
0.5: Graphs as an Intermediate Representation for Partial Evaluation - Weise (1990)
(Correct)
0.4: Lambda-Dropping: Transforming Recursive Equations into Programs.. - Danvy (1995)
(Correct)
Related documents from co-citation: More All
24: Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
12: Sound specialization in the presence of computational effects
- Lawall, Thiemann - 1997
11: Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
BibTeX entry: (Update)
John Hatcliff and Olivier Danvy. A computational formalization for partial evaluation. Mathematical Structures in Computer Science, 7(5):507--542, 1997. http://citeseer.ist.psu.edu/article/hatcliff97computational.html More
@article{ hatcliff97computational,
author = "John Hatcliff and Olivier Danvy",
title = "A Computational Formalization for Partial Evaluation",
journal = "Mathematical Structures in Computer Science",
volume = "7",
number = "5",
pages = "507-541",
year = "1997",
url = "citeseer.ist.psu.edu/article/hatcliff97computational.html" }
Citations (may not include all citations):
729
The Lambda Calculus --- Its Syntax and Semantics (context) - Barendregt - 1984
638
Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
369
Information and Computation (context) - Moggi, computation - 1991
293
The essence of functional programming
- Wadler - 1992
283
Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
224
Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
206
Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
158
Reasoning about programs in continuation-passing style
- Sabry, Felleisen - 1993
155
The essence of compiling with continuations
- Flanagan, Sabry et al. - 1993
143
A modal analysis of staged computation
- Davies, Pfenning - 1996
122
Type-directed partial evaluation
- Danvy - 1996
120
Monad transformers and modular interpreters
- Liang, Hudak et al. - 1995
99
A partial evaluator for the untyped lambda-calculus
- Gomard, Jones - 1991
98
MIX: A self-applicable partial evaluator for experiments in .. (context) - Jones, Sestoft et al. - 1989
96
Automatic autoprojection of recursive equations with global ..
- Bondorf, Danvy - 1991
94
Mathematical Structures in Computer Science (context) - Wadler - 1992
80
A temporal-logic approach to binding-time analysis
- Davies - 1996
76
a better support of static data flow
- Consel, Danvy - 1991
70
Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
69
A tour of Schism: A partial evaluation system for higher-ord..
- Consel - 1993
67
Representing monads
- Filinski - 1994
62
Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
54
Building interpreters by composing monads
- Jr - 1994
49
Specifying the correctness of binding-time analysis (context) - Wand - 1993
47
volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
45
Synthesis of ML programs in the system Coq (context) - Paulin-Mohring, Werner - 1993
45
New foundations for fixpoint computations: FIXhyperdoctrines.. (context) - Crole, Pitts - 1992
41
Continuation-based partial evaluation
- Lawall, Danvy - 1994
40
A denotational framework for data flow analysis (context) - Nielson - 1982
39
Improving binding times without explicit cps-conversion (context) - Bondorf - 1992
38
volume 34 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Nielson, Nielson et al. - 1992
37
A generic account of continuation-passing styles
- Hatcliff, Danvy - 1994
35
CPS transformation after strictness analysis
- Danvy, Hatcliff - 1993
31
Correctness of binding-time analysis
- Palsberg - 1993
31
A self-applicable partial evaluator for the lambda-calculus:.. (context) - Gomard - 1992
27
A computational formalization for partial evaluation
- Hatcliff, Danvy - 1996
27
Efficient multi-level generating extensions for program spec..
- Gluck, Jorgensen - 1995
26
Cogen in six lines
- Thiemann - 1996
24
Strictness Analysis of Lazy Functional Programs (context) - Benton - 1995
24
Proving the correctness of recursion-based automatic program..
- Sands - 1995
24
Almquist and Wiksell (context) - Prawitz - 1965
21
A strongly-typed self-applicable partial evaluator (context) - Launchbury - 1991
16
Department of Computing and Information Sciences (context) - Hatcliff, of et al. - 1994
14
Towards unifying partial evaluation (context) - Sorensen, Gluck et al. - 1994
14
Mechanically verifying the correctness of an offline partial..
- Hatcliff - 1995
13
Call-by-name CPS-translation as a binding-time improvement
- Nielsen, Sorensen - 1995
12
ACM Transactions on Programming Languages and Systems (context) - Danvy, Malmkjaer et al. - 1996
12
A theory for program and data type specification (context) - Talcott - 1992
11
Wiley Professional Computing (context) - Nielson, Nielson et al. - 1992
8
Computer Science Department (context) - Nielsen, DIKU - 1997
7
Special issue on Partial Evaluation (context) - Jones - 1993
7
Compiling with reflections (context) - Sabry, Wadler - 1996
6
Deriving mixed evaluation from standard evaluation for a sim.. (context) - Hannan, Miller - 1989
6
Technical Report No (context) - Gordon, Input et al. - 1993
5
Factoring an adequacy proof (context) - Crole, Gordon - 1993
4
Berichte des WilhelmSchickard -Instituts WSI (context) - Dussart, Thiemann et al. - 1996
4
An operational theory of self-applicable on-line program spe.. (context) - Hatcliff, Gluck - 1996
3
Seventh International Symposium on Programming Language Impl.. (context) - Hermenegildo, Swierstra - 1995
1
Katholieke Universiteit Leuven (context) - formalization, evaluation et al. - 1997
1
Computational types from a logical perspective (context) - Hatcliff, Danvy et al. - 1995
1
Partial evaluation is fuller laziness (context) - Hatcliff, Danvy et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.ksu.edu/~hatcliff/papers.html): More
Mechanically Verifying the Correctness of an Offline Partial.. - Hatcliff (1995)
(Correct)
CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996)
(Correct)
Reflections on Reflections - Barthe, Hatcliff, Sørensen (1997)
(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