A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trivial - Extended abstract

Authors
Citation
W. Taha, A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trivial - Extended abstract, ACM SIGPL N, 34(11), 1999, pp. 34-43
Citations number
36
Categorie Soggetti
Computer Science & Engineering
Journal title
ACM SIGPLAN NOTICES
ISSN journal
15232867 → ACNP
Volume
34
Issue
11
Year of publication
1999
Pages
34 - 43
Database
ISI
SICI code
1523-2867(199911)34:11<34:ASRSFU>2.0.ZU;2-N
Abstract
A multi-stage computation is one involving more than one stage of execution . MetaML is a language for programming multi-stage computations. Previous s tudies presented big-step semantics, categorical semantics, and sound type systems for MetaML. In this paper, we report on a confluent and sound reduc tion semantics for untyped call-by name (CBN) MetaML. The reduction semanti cs can be used to formally justify some optimization performed by a CBN Met aML implementation. The reduction semantics demonstrates that non-trivial e qualities 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.