Sciweavers

19 search results - page 1 / 4
» On Jones-Optimal Specialization for Strongly Typed Languages
Sort
View
SAIG
2000
Springer
13 years 8 months ago
On Jones-Optimal Specialization for Strongly Typed Languages
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
Henning Makholm
PADO
2001
Springer
13 years 9 months ago
Tag Elimination and Jones-Optimality
Tag elimination is a program transformation for removing unnecessary tagging and untagging operations from automatically generated programs. Tag elimination was recently proposed a...
Walid Taha, Henning Makholm, John Hughes
ESOP
2003
Springer
13 years 10 months ago
Tagging, Encoding, and Jones Optimality
A partial evaluator is said to be Jones-optimal if the result of specializing a self-interpreter with respect to a source program is textually identical to the source program, modu...
Olivier Danvy, Pablo E. Martínez Lóp...
ICFP
1997
ACM
13 years 9 months ago
Strongly Typed Flow-Directed Representation Transformations
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
Allyn Dimock, Robert Muller, Franklyn A. Turbak, J...
PLDI
2010
ACM
14 years 2 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala