Compiling functional types to relational specifications for low level imperative code

Authors:
Nick Benton;Nicolas Tabareau
Affiliations:
Microsoft Research, Cambridge, United Kingdom;Universite Denis Diderot, Paris, France
Venue:
Proceedings of the 4th international workshop on Types in language design and implementation
Year:
2009

Citing 21
Cited 8

Abstract types have existential type

ACM Transactions on Programming Languages and Systems (TOPLAS)
Typed closure conversion

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operational reasoning for functions with local state

Higher order operational techniques in semantics
Intersection types and computational effects

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
An indexed model of recursive types for foundational proof-carrying code

ACM Transactions on Programming Languages and Systems (TOPLAS)
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Semantic types: a fresh look at the ideal model for types

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiler verification: a bibliography

ACM SIGSOFT Software Engineering Notes
Building certified libraries for PCC: dynamic storage allocation

Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Semantics of types for mutable state

Semantics of types for mutable state
Formal certification of a compiler back-end or: programming a compiler with a proof assistant

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Certified assembly programming with embedded code pointers

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A very modal model of a modern, major, general type system

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational separation logic

Theoretical Computer Science
A certified type-preserving compiler from lambda calculus to assembly language

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Formalizing and verifying semantic type soundness of a simple compiler

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Typed closure conversion preserves observational equivalence

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
State-dependent representation independence

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstracting allocation

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Relational reasoning in a nominal semantics for storage

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Biorthogonality, step-indexing and compiler correctness

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
A theory of indirection via approximation

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A relational modal logic for higher-order stateful ADTs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bringing extensibility to verified compilers

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
The impact of higher-order state and control effects on local relational reasoning

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Formalizing the LLVM intermediate representation for verified program transformations

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Non-parametric parametricity

Journal of Functional Programming - Dedicated to ICFP 2009
High-level separation logic for low-level code

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

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.