License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TYPES.2013.230
URN: urn:nbn:de:0030-drops-46343
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4634/
RodrÃguez, Leonardo ;
Fridlender, Daniel ;
Pagano, Miguel
A Certified Extension of the Krivine Machine for a Call-by-Name Higher-Order Imperative Language
Abstract
In this paper we present a compiler that translates programs from an
imperative higher-order language into a sequence of instructions
for an abstract machine. We consider an extension of the Krivine machine for the call-by-name lambda calculus, which includes strict operators and imperative features. We show that the compiler is
correct with respect to the big-step semantics of our language, both
for convergent and divergent programs.
BibTeX - Entry
@InProceedings{rodrguez_et_al:LIPIcs:2014:4634,
author = {Leonardo Rodr{\'i}guez and Daniel Fridlender and Miguel Pagano},
title = {{A Certified Extension of the Krivine Machine for a Call-by-Name Higher-Order Imperative Language}},
booktitle = {19th International Conference on Types for Proofs and Programs (TYPES 2013)},
pages = {230--250},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-72-9},
ISSN = {1868-8969},
year = {2014},
volume = {26},
editor = {Ralph Matthes and Aleksy Schubert},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4634},
URN = {urn:nbn:de:0030-drops-46343},
doi = {10.4230/LIPIcs.TYPES.2013.230},
annote = {Keywords: Abstract Machines, Compiler Correctness, Big-step semantics}
}
Keywords: |
|
Abstract Machines, Compiler Correctness, Big-step semantics |
Collection: |
|
19th International Conference on Types for Proofs and Programs (TYPES 2013) |
Issue Date: |
|
2014 |
Date of publication: |
|
25.07.2014 |