 |
|
|
|
| HAL : hal-00475210, version 2 |
| Fiche détaillée |  Récupérer au format |
|
|
| Workshop LOLA 2010, Syntax and Semantics of Low Level Languages, Edinburgh : United Kingdom (2010) |
|
|
| Versions disponibles : | v1 (21-04-2010) | v2 (12-05-2010) |
|
|
|
|
| Krivine realizability for compiler correctness |
|
|
| Guilhem Jaber 1, 2Nicolas Tabareau 2, 3 |
|
|
| (09/07/2010) |
|
|
|
| We propose a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple functional language to SECD machine code. Our result is quite independent from the source language as it uses Krivine's realizability to give a denotational semantics to SECD machine code using only the type system of the source language. We use realizability to prove the correctness of both a call-by-name (CBN) and a call-by-value (CBV) compiler with the same notion of orthogonality. We abstract over the notion of observation (e.g. divergence or termination) and derive an operational correctness result that relates the reduction of a term with the execution of its compiled SECD machine code. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Ecole Normale Supérieure de Cachan (ENS Cachan) |
|
|
|
École normale supérieure de Cachan - ENS Cachan |
|
|
| 2 : | ASCOLA (INRIA - EMN) |
|
|
|
INRIA – Ecole des Mines de Nantes |
|
|
| 3 : | Laboratoire d'Informatique de Nantes Atlantique (LINA) |
|
|
|
CNRS : UMR6241 – Université de Nantes – Ecole des Mines de Nantes |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Langage de programmation Informatique/Logique en informatique |
|
|
| compiler correctness – realizability – secd |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00475210, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00475210 | |
| oai:hal.archives-ouvertes.fr:hal-00475210 | |
| Contributeur : Nicolas Tabareau | |
| Soumis le : Mercredi 12 Mai 2010, 13:58:59 | |
| Dernière modification le : Mercredi 12 Mai 2010, 15:57:47 | |
