Compiling Functional Types to Relational Specifications for Low Level Imperative Code

Abstract : We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple functional language into an idealized assembly language. Types in the high-level language are interpreted as binary relations, built using both second-order quantification and separation, over stores and values in the low-level machine.
Document type :
Conference papers
Types in Language Design and Implementation, Jan 2009, Savannah, United States. 2009
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00341404
Contributor : Nicolas Tabareau <>
Submitted on : Tuesday, November 25, 2008 - 9:52:28 AM
Last modification on : Tuesday, October 11, 2016 - 1:59:32 PM
Document(s) archivé(s) le : Thursday, October 11, 2012 - 12:05:37 PM

File

compiler_relation.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00341404, version 1

Collections

PPS | INSMI | USPC

Citation

Nick Benton, Nicolas Tabareau. Compiling Functional Types to Relational Specifications for Low Level Imperative Code. Types in Language Design and Implementation, Jan 2009, Savannah, United States. 2009. <hal-00341404>

Share

Metrics

Record views

179

Document downloads

69