hh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Staged Notational Definitions
Department of Computer Science, Rice University, Houston, TX, USA.
Department of Computer Science, Rutgers University, Camden, New Jersey, USA.
2003 (Engelska)Ingår i: Generative Programming and Component Engineering: Second International Conference, GPCE 2003, Erfurt, Germany, September 22-25, 2003. Proceedings / [ed] Frank Pfenning & Yannis Smaragdakisd, Berlin: Springer Berlin/Heidelberg, 2003, s. 97-116Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Recent work proposed defining type-safe macros via interpretation into a multi-stage language. The utility of this approach wasillustrated with a language called MacroML, in which all type checking is carried out before macro expansion. Building on this work, thegoal of this paper is to develop a macro language that makes it easy forprogrammers to reason about terms locally. We show that defining thesemantics of macros in this manner helps in developing and verifyingnot only type systems for macro languages but also equational reasoning principles. Because the MacroML calculus is sensetive to renamingof (what appear locally to be) bound variables, we present a calculus ofstaged notational definitions (SND) that eliminates the renaming problem but retains MacroML’s phase distinction. Additionally, SND incorporates the generality of Griffin’s account of notational definitions. Weexhibit a formal equational theory for SND and prove its soundness.

Ort, förlag, år, upplaga, sidor
Berlin: Springer Berlin/Heidelberg, 2003. s. 97-116
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2830
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:hh:diva-20978DOI: 10.1007/978-3-540-39815-8_6ISI: 000187710700006Libris ID: 9466762ISBN: 978-3-540-20102-1 ISBN: 978-3-540-39815-8 OAI: oai:DiVA.org:hh-20978DiVA, id: diva2:588277
Konferens
GPCE'03 – Second International Conference on Generative Programming and Component Engineering, Erfurt, Germany, September 22-25, 2003
Anmärkning

W. T. funded by NSF ITR-0113569.

Tillgänglig från: 2013-01-15 Skapad: 2013-01-14 Senast uppdaterad: 2018-03-22Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Taha, Walid

Sök vidare i DiVA

Av författaren/redaktören
Taha, Walid
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 109 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf