hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tag Elimination and Jones-Optimality (Preliminary Report)
Department of Computer Science, Yale University, New Haven, CT, USA.
DIKU, University of Copenhagen, Copenhagen, Denmark.
Department of Computing Sciences, Chalmers, Göteborg, Sweden.
2001 (English)In: Programs as Data Objects: Second Symposium, PADO2001 Aarhus, Denmark, May 21–23, 2001 Proceedings / [ed] Olivier Danvy & Andrzej Filinski, Berlin: Springer Berlin/Heidelberg, 2001, 257-275 p.Conference paper, Published paper (Refereed)
Abstract [en]

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. © Springer-Verlag Berlin Heidelberg 2001.

Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 2001. 257-275 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2053
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20988DOI: 10.1007/3-540-44978-7_15ISI: 000174206300015Scopus ID: 2-s2.0-84888249819Libris ID: 5368702ISBN: 978-3-540-42068-2 ISBN: 978-3-540-44978-2 OAI: oai:DiVA.org:hh-20988DiVA: diva2:588293
Conference
PADO-II, Second Symposium on Programs as Data Objects, Aarhus, Denmark, May 21–23, 2001
Funder
Swedish Research Council
Note

W. T. funded by a Postdoctoral Fellowship from the Swedish Research Council for Engineering Sciences (TFR), grant number 221-96-403, and by subcontract #8911-48186 from Johns Hopkins University under NSF agreement Grant # EIA-9996430. H. M. funded by the University of Copenhagen.

Available from: 2013-01-15 Created: 2013-01-14 Last updated: 2015-08-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Taha, Walid
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 67 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf