 |
|
|
|
| HAL : hal-00341404, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| Types in Language Design and Implementation, Savannah : États-Unis d'Amérique (2009) |
|
|
|
|
| Compiling Functional Types to Relational Specifications for Low Level Imperative Code |
|
|
| Nick Benton 1Nicolas Tabareau 2 |
|
|
| (01/2009) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Microsoft Research [Cambridge] (Microsoft) |
|
|
|
Microsoft Research |
|
|
| 2 : | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Domaine | : | Mathématiques/Catégories et ensembles Informatique/Langage de programmation |
|
|
| Compiler verification – type soundness – relational parametricity – separation logic – proof assistants |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00341404, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00341404 | |
| oai:hal.archives-ouvertes.fr:hal-00341404 | |
| Contributeur : Nicolas Tabareau | |
| Soumis le : Mardi 25 Novembre 2008, 09:52:28 | |
| Dernière modification le : Mardi 25 Novembre 2008, 10:30:54 | |
