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 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-optimality1 .

• Type: Conference
• Year: 2001
• Where: PADO
• Authors: Walid Taha, Henning Makholm, John Hughes
• Keywords: Domain Specific Languages, Elimination Achieves Jones-optimality1, PADO 2001, Programming Languages, Tag Elimination