Compiling Functional Types to Relational Specifications for Low Level Imperative Code

Nick Benton (1) , Nicolas Tabareau (2)

1 Microsoft - Microsoft Research [Cambridge]
2 PPS - Preuves, Programmes et Systèmes

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.

Keywords: Compiler verification; type soundness; relational parametricity; separation logic; proof assistants

Domains: Category Theory [math.CT]; Programming Languages [cs.PL]

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. ⟨hal-00341404⟩