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

Authors:
Adam Chlipala
Affiliations:
University of California, Berkeley, Berkeley, CA
Venue:
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Year:
2007

Citing 16
Cited 26

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A mechanically verified language implementation

Journal of Automated Reasoning
VLISP: a verified implementation of Scheme

Lisp and Symbolic Computation
TIL: a type-directed optimizing compiler for ML

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Tagless staged interpreters for typed languages

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Using Reflection to Build Efficient and Certified Decision Procedures

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Codifying Guarded Definitions with Recursive Schemes

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Compiler verification: a bibliography

ACM SIGSOFT Software Engineering Notes
The view from the left

Journal of Functional Programming
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Languages of the future

OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
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
A general framework for certifying garbage collectors and their mutators

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Subset coercions in Coq

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Mechanized metatheory for the masses: the PoplMark challenge

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

A type-preserving closure conversion in haskell

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
A type-preserving compiler in Haskell

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Parametric higher-order abstract syntax for mechanized semantics

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Compiling functional types to relational specifications for low level imperative code

Proceedings of the 4th international workshop on Types in language design and implementation
Extensible Proof-Producing Compilation

CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Biorthogonality, step-indexing and compiler correctness

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
A universe of binding and computation

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Verified LISP Implementations on ARM, x86 and PowerPC

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A Formally Verified Compiler Back-end

Journal of Automated Reasoning
Certify Once, Trust Anywhere: Modular Certification of Bytecode Programs for Certified Virtual Machine

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
A verified compiler for an impure functional language

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Arity-generic datatype-generic programming

Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Mechanized verification of CPS transformations

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Trusted source translation of a total function language

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Bringing extensibility to verified compilers

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
A fresh look at programming with names and binders

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
A certified framework for compiling and executing garbage-collected languages

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
A kripke logical relation between ML and assembly

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming inductive proofs: a new approach based on contextual types

Verification, induction termination analysis
Programming inductive proofs: a new approach based on contextual types

Verification, induction termination analysis
Validated compilation through logic

FM'11 Proceedings of the 17th international conference on Formal methods
An equivalence-preserving CPS translation via multi-language semantics

Proceedings of the 16th 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
GMETA: a generic formal metatheory framework for first-order representations

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Generic programming with dependent types

SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Translation validation for a verified OS kernel

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a certified compiler from the simply-typed lambda calculus to assembly language. The compiler is certified in the sense that it comes with a machine-checked proof of semantics preservation, performed with the Coq proof assistant. The compiler and the terms of its several intermediate languages are given dependent types that guarantee that only well-typed programs are representable. Thus, type preservation for each compiler pass follows without any significant "proofs" of the usual kind. Semantics preservation is proved based on denotational semantics assigned to the intermediate languages. We demonstrate how working with a type-preserving compiler enables type-directed proof search to discharge large parts of our proof obligations automatically.