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
A Sound Reduction Semantics for Untyped CBN Multi-Stage Computation: Or, the Theory of MetaML is Non-trivial (Extended Abstract)
Department of Computing Science, Chalmers University of Technology and the University of Göteborg, Göteborg, Sweden.
2000 (English)In: PEPM '00: Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, New York, NY: ACM Press, 2000, Vol. 34, 34-43 p.Conference paper, Published paper (Refereed)
Abstract [en]

A multi-stage computation is one involving more than one stage of execution. MetaML is a language for programming multi-stage computations. Previous studies presented big-step semantics, categorical semantics, and sound type systems for MetaML. In this paper, we report on a confluent and sound reduction semantics for untyped call-by name (CBN) MetaML. The reduction semantics can be used to formally justify some optimization performed by a CBN MetaML implementation. The reduction semantics demonstrates that non-trivial equalities hold for object-code, even in the untyped setting. The paper also emphasizes that adding intensional analysis (that is, taking-apart object programs) to MetaML remains an interesting open problem. © 2000 ACM, Inc.

Place, publisher, year, edition, pages
New York, NY: ACM Press, 2000. Vol. 34, 34-43 p.
Series
ACM / SIGPLAN Notices, ISSN 0362-1340 ; 11
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20991DOI: 10.1145/328691.328697ISI: 000084855700007Scopus ID: 2-s2.0-0033691593Libris ID: 12438393ISBN: 1-58113-201-8 OAI: oai:DiVA.org:hh-20991DiVA: diva2:588299
Conference
PEPM'00 – International Symposium on Partial Evaluation and Semantics Based Program Manipulation, Boston, MA, USA, 22-23 January, 2000
Funder
Swedish Research Council
Note

The research reported in this paper was carried out at the Pacific Software Research Center (PacSoft), Department of Computer Science and Engineering, Oregon Graduate Institute of Science & Technology, Portland, OR, USA, and was supported by the USAF Air Materiel Command, contract # F19628-93-C-0069, and NSF Grant IRI-9625462. The paper is based on results presented in the author's PhD dissertation. Author is currently a Post-doctoral Fellow supported by the Swedish Research Council for Engineering Sciences (TFR), grant number 221-96-403.

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: 95 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