Affiliation:
1. Department of Computing Science, Chalmers University of Technology and the University of Göteborg, S-412 96 Göteborg, Sweden
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference35 articles.
1. BARENDREGT H. P.
The Lambda Calculus: Its Syntax and Semantics revised ed
. vol.
103
of
Studies in Logic and the Foundations of Mathematics
.
North-Holland Amsterdam 1984
.]] BARENDREGT H. P. The Lambda Calculus: Its Syntax and Semantics revised ed. vol. 103 of Studies in Logic and the Foundations of Mathematics. North-Holland Amsterdam 1984.]]
2. A modal analysis of staged computation
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献