A Type-directed, On-line, Partial Evaluator for a Polymorphic Language (1997)
| Venue: | In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation |
| Citations: | 13 - 3 self |
BibTeX
@INPROCEEDINGS{Sheard97atype-directed,,
author = {Tim Sheard},
title = {A Type-directed, On-line, Partial Evaluator for a Polymorphic Language},
booktitle = {In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation},
year = {1997},
pages = {22--35},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recently, Olivier Danvy introduced a new, simple method for implementing powerful partial evaluators, namely typedirected partial evaluation[9]. He introduced a partial evaluator for the simply-typed lambda calculus (x2). This paper explores the possibility of using the same techniques over a lambda calculus with a richer type system. We generalize and extend Danvy's work in four ways: 1. Our system handles a much richer language than that presented by Danvy, including all of the features functional programmers have come to expect, such as polymorphism (x5), inductive datatypes (x10), and recursion (x9). 2. Our system includes a new systematic treatment of primitive operators (x7) and the propagation of residualized code (x7.1). This question has either been ignored or treated in an ad-hoc manner in previous work. 3. Our system handles non-closed terms (x6). This makes type-directed partial evaluation much more practically useful, and can easily be extended to work in languages wit...
