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

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2007, Pages 54-65

  Chlipala, Adam ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Compiler verification; Denotational semantics; Dependent types; Interactive proof assistants

Indexed keywords

COMPILER VERIFICATION; DENOTATIONAL SEMANTICS; DEPENDENT TYPES; INTERACTIVE PROOF ASSISTANTS;

COMPUTER PROGRAMMING LANGUAGES; ONLINE SEARCHING; SEMANTICS; WEB SERVICES;

PROGRAM COMPILERS;

EID: 35448937613     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250734.1250742     Document Type: Conference Paper

References (22)

1. Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, and Steve Zdancewic. Mechanized metatheory for the masses: The POPLMARK challenge. In Proc. TPHOLs, pages 50-65, 2005.
2. Yves Bertot and Pierre Castéran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer Verlag, 2004.
3. Samuel Boutin. Using reflection to build efficient and certified decision procedures. In Proc. STACS, pages 515-529, 1997.
4. Maulik A. Dave. Compiler verification: a bibliography. SIGSOFT Softw. Eng. Notes, 28(6):2-2, 2003.
5. Nicolas G. de Bruijn. Lambda-calculus notation with nameless dummies: a tool for automatic formal manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381-392, 1972.
6. Eduardo Giménez. Codifying guarded definitions with recursive schemes. In Proc. TYPES, pages 39-59. Springer-Verlag, 1995.
7. Joshua D. Guttman, John D. Ramsdell, and Mitchell Wand. VLISP: A verified implementation of Scheme. Lisp and Symbolic Computation, 8(1/2):5-32, 1995.
8. Furio Honsell and Donald Sannella. Pre-logical relations. In Proc. CSL, pages 546-561, 1999.
9. Xavier Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In Proc. POPL, pages 42-54, 2006.
10. Conor McBride and James McKinna. The view from the left. J. Functional Programming, 14(1):69-111, 2004.
11. Yasuhiko Minamide, Greg Morrisett, and Robert Harper. Typed closure conversion. Technical Report CMU-CS-FOX-95-05, Carnegie Mellon University, 1995.
12. J. Strother Moore. A mechanically verified language implementation. J. Automated Reasoning, 5(4):461-492, 1989.
13. Andrew McCreight, Zhong Shao, Chunxiao Lin, and Long Li. A general framework for certifying garbage collectors and their mutators. In Proc. PLDI, 2007.
14. Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From System F to typed assembly language. ACM Trans. Program. Lang. Syst., 21(3):527-568, 1999.
15. F. Pfenning and C. Elliot. Higher-order abstract syntax. In Proc. PLDI, pages 199-208, 1988.
16. G. D. Plotkin. Lambda-definability and logical relations. Memorandum SAI-RM-4, University of Edinburgh, 1973.
17. Gordon D. Plotkin. Call-by-name, call-by-value, and the lambda calculus. Theoretical Computer Science, 1:125-159, 1975.
18. Frank Pfenning and Carsten Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In Proc. CADE, pages 202-206, 1999.
19. Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In Proc. ICFP, pages 218-229, 2002.
20. Tim Sheard. Languages of the future. In Proc. OOPSLA, pages 116-119, 2004.
21. Matthieu Sozeau. Subset coercions in Coq. In Proc. TYPES, 2006.
22. D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, and P. Lee. TIL: a type-directed optimizing compiler for ML. In Proc. PLDI, pages 181-192, 1996.