(Enter summary)
Abstract: We formalize a partial evaluator for Eugenio Moggi's computational
metalanguage. This formalization gives an evaluation-order independent
view of binding-time analysis and program specialization, including
a proper treatment of call unfolding, and enables us to express
the essence of "control-based binding-time improvements" for let expressions. (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):
79.3%: A Computational Formalization for Partial Evaluation.. - Hatcliff, Danvy (1997)
(Correct)
49.7%: A Computational Formalization for Partial Evaluation - Hatcliff, Danvy (1997)
(Correct)
Active bibliography (related documents): More All
0.5: Eta-Expansion does the Trick - Danvy, Malmkjaer, Palsberg (1996)
(Correct)
0.4: Mechanically Verifying the Correctness of an Offline Partial.. - Hatcliff (1995)
(Correct)
0.3: Two for the Price of One: Composing Partial Evaluation and.. - Sperber, Thiemann (1997)
(Correct)
Similar documents based on text: More All
1.3: Compiling Actions by Partial Evaluation, Revisited - Danvy, Rhiger (1998)
(Correct)
1.2: A Unifying Approach to Goal-Directed Evaluation - Danvy, Grobauer, Rhiger (2001)
(Correct)
1.2: A Simple Take on Typed Abstract Syntax in Haskell-like Languages - Danvy, Rhiger (2000)
(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/hatcliff96computational.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/hatcliff96computational.html" }
Citations (may not include all citations):
638
Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
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 selfapplicable partial evaluator for experiments in c.. (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
87
Notions of computation and monads
- Moggi
83
volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
80
A temporal-logic approach to binding-time analysis
- Davies - 1996
76
a better support of static data flow
- Consel, Danvy
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
62
Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
54
Building interpreters by composing monads
- Jr
51
Computational types from a logical perspective
- Benton, Bierman et al. - 1995
49
Specifying the correctness of binding-time analysis (context) - Wand
45
Synthesis of ML programs in the system Coq (context) - Paulin-Mohring, Werner - 1993
45
New foundations for fixpoint computations: FIX-hyperdoctrine.. (context) - Crole, Pitts
40
The Lambda Calculus --- Its Syntax and Semantics (context) - Barendregt - 1984
40
A denotational framework for data flow analysis (context) - Nielson - 1982
38
volume 34 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Nielson, Nielson et al. - 1992
35
CPS transformation after strictness analysis
- Danvy, Hatcliff - 1993
31
A self-applicable partial evaluator for the lambdacalculus: .. (context) - Gomard - 1992
31
Correctness of binding-time analysis
- Palsberg
29
The essence of eta-expansion in partial evaluation
- Danvy, Malmkjaer et al.
29
Is continuation-passing useful for data flow analysis
- Sabry, Felleisen - 1994
26
A generic account of continuationpassing styles (context) - Hatcliff, Danvy
26
Cogen in six lines
- Thiemann
24
Almquist and Wiksell (context) - Prawitz - 1965
24
Strictness Analysis of Lazy Functional Programs (context) - Benton - 1995
24
Proving the correctness of recursion-based automatic program..
- Sands - 1995
21
A strongly-typed self-applicable partial evaluator (context) - Launchbury
18
Occam's razor in metacomputation: the notion of a perfect pr..
- Gluck, Klimov - 1993
16
Department of Computing and Information Sciences (context) - Hatcliff, of et al. - 1994
15
Improving CPS-based partial evaluation: Writing cogen by han..
- Bondorf, Dussart - 1994
14
Towards unifying partial evaluation (context) - Srensen, Gluck et al. - 1994
14
Mechanically verifying the correctness of an offline partial..
- Hatcliff
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
Partial evaluation is fuller laziness (context) - Holst, Gomard - 1991
11
Wiley Professional Computing (context) - Nielson, Nielson et al. - 1992
8
Improving binding times without explicit cpsconversion (context) - Bondorf
8
Computer Science Department (context) - Nielsen, DIKU - 1997
7
Compiling with reflections (context) - Sabry, Wadler
7
Special issue on Partial Evaluation (context) - Jones - 1993
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
4
Berichte des Wilhelm-Schickard-Instituts WSI (context) - Dussart, Thiemann et al. - 1996
4
An operational theory of selfapplicable on-line program spec.. (context) - Hatcliff, Gluck - 1996
3
Seventh International Symposium on Programming Language Impl.. (context) - Hermenegildo, Swierstra - 1995
2
Call-by-name CPStranslation as a binding-time improvement (context) - Nielsen, Srensen - 1995
2
Katholieke Universiteit Leuven (context) - Dussart - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/RS/96/Ref/BRICS-RS-96-Ref/): More
On a Question of A. Salomaa: The Equational Theory of.. - Aceto, Fokkink.. (1996)
(Correct)
Proof of a Conjecture of S. Mac Lane - Soloviev (1996)
(Correct)
Compositional and Symbolic Model-Checking of Real-Time Systems - Larson, Pettersson, Yi (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