1996
DOI: 10.7146/brics.v3i34.20015
|View full text |Cite
|
Sign up to set email alerts
|

A Computational Formalization for Partial Evaluation (Extended Version)

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. Specifically, we prove that the binding-time improvements given by "continuation-based specialization" can be expressed in the metalanguage via monadic laws.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1996
1996
2003
2003

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 55 publications
0
1
0
Order By: Relevance
“…However, one must strengthen the statement to be proved so as to handle arbitrary stacks of interpretation contexts in the inductive hypothesis. We refer the reader to the extended version of this paper for the full proof (Hatcliff and Danvy 1996).…”
Section: Equivalence With Continuation-based Specializationmentioning
confidence: 99%
“…However, one must strengthen the statement to be proved so as to handle arbitrary stacks of interpretation contexts in the inductive hypothesis. We refer the reader to the extended version of this paper for the full proof (Hatcliff and Danvy 1996).…”
Section: Equivalence With Continuation-based Specializationmentioning
confidence: 99%