Show simple item record

dc.contributor.authorAktemur, Tankut Barış
dc.contributor.authorChoi, W.
dc.date.accessioned2010-06-10T05:51:09Z
dc.date.available2010-06-10T05:51:09Z
dc.date.issued06.09.2010
dc.identifier.urihttp://hdl.handle.net/10679/52
dc.description.abstractIt has been previously shown that there is a close relation between record calculus and program generation (e.g. Lisp-like quasiquotations): A translation has been defined to convert staged expressions to record calculus expressions, and it has been shown that the call-by-value semantics of the staged and the record calculi are equivalent modulo the translation and admin reductions. In this work, we investigate the relation further. The contributions are twofold: (1) We fine-tune the previously shown relation between the two operational semantics, and obtain more precise results. In particular, we show that only two kinds of admin reductions suffice, and these reductions can be applied exhaustively. (2) We define a reverse translation that converts record calculus expressions back to the staged calculus, allowing us to go back and forth between the two calculi. We believe that these results provide an important step towards reusing already-existing record calculus static analyses to reason about staged expressions.en_US
dc.language.isoengen_US
dc.publisherÖzyeğin Universityen_US
dc.relation.ispartofseriesOzyegin University Technical Report;OZU-COMP-2010-0001
dc.rightsopenAccess
dc.titleRelating Staged Computation to the Record Calculusen_US
dc.typeTechnical reporten_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID124803
dc.contributor.ozuauthorAktemur, Tankut Barış
dc.subject.keywordsrecord calculusen_US
dc.subject.keywordsprogram generationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


Share this page