Tag Elimination and Jones-Optimality

Authors:
Walid Taha;Henning Makholm;John Hughes
Affiliations:
-;-;-
Venue:
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Year:
2001

Citing 14
Cited 5

Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
A syntactic approach to type soundness

Information and Computation
Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Multi-stage programming with explicit annotations

PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Type specialization

ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Encoding types in ML-like languages

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
The Theory of Fexprs is Trivial

Lisp and Symbolic Computation
A sound reduction semantics for untyped CBN mutli-stage computation. Or, the theory of MetaML is non-trival (extended abstract)

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation

SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
The Correctness of Type Specialisation

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
On Abstraction and the Expressive Power of Programming Languages

TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Simple Solution to Type Specialization

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
LEAP: A Language with Eval And Polymorphism

TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
An Idealized MetaML: Simpler, and More Expressive

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems

Programming in Ωmega

Central European Functional Programming School
Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Typed self-interpretation by pattern matching

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
On jones-optimal specializers: a case study using unmix

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Gradual typing for objects

ECOOP'07 Proceedings of the 21st European conference on Object-Oriented Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tag elimination is a program transformation for removing unnecessary tagging and untagging operations from automatically generated programs. Tag elimination was recently proposed as having immediate applications in implementations of domain specific languages (where it can give a two-fold speedup), and may provide a solution to the long standing problem of Jones-optimal specialization in the typed setting. This paper explains in more detail the role of tag elimination in the implementation of domain-specific languages, presents a number of significant simplifications and a high-level, higher-order, typed self-applicable interpreter. We show how tag elimination achieves Jones-optimality.