Krivine Realizability for Compiler Correctness - DUMAS - Dépôt Universitaire de Mémoires Après Soutenance
Mémoires Année : 2010

Krivine Realizability for Compiler Correctness

Résumé

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.
Fichier principal
Vignette du fichier
JaberGuilhem.pdf (317.23 Ko) Télécharger le fichier
Loading...

Dates et versions

dumas-00530710 , version 1 (29-10-2010)

Identifiants

  • HAL Id : dumas-00530710 , version 1

Citer

Guilhem Jaber. Krivine Realizability for Compiler Correctness. Symbolic Computation [cs.SC]. 2010. ⟨dumas-00530710⟩
212 Consultations
201 Téléchargements

Partager

More