A verified compiler for an impure functional language

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2010, Pages 93-106

  Chlipala, Adam ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Compiler verification; Interactive proof assistants

Indexed keywords

ASSEMBLY LANGUAGE; CLOSURE CONVERSION; COMMON SUBEXPRESSION ELIMINATION; CONTINUATION-PASSING STYLE; COQ PROOF ASSISTANT; FUNCTIONAL LANGUAGES; HIGHER-ORDER ABSTRACT SYNTAX; INTERACTIVE PROOF ASSISTANTS; LANGUAGE FEATURES; META LANGUAGE; NEW APPROACHES; OPERATIONAL SEMANTICS; PROGRAMMING LANGUAGE; PROOF ASSISTANT; REPRESENTATION TECHNIQUES; TACTIC LANGUAGE; TARGET LANGUAGE; TYPE THEORY;

BINDERS; COMPUTER SOFTWARE REUSABILITY; COMPUTER SOFTWARE SELECTION AND EVALUATION; FORMAL LOGIC; LINGUISTICS; QUERY LANGUAGES; SEMANTICS; SYNTACTICS;

PROGRAM COMPILERS;

EID: 77950884123     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1706299.1706312     Document Type: Conference Paper

References (24)

1. Brian Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, and Stephanie Weirich. Engineering formal metatheory. In Proc. POPL, pages 3-15, 2008.
2. Nick Benton and Chung-Kil Hur. Biorthogonality, step-indexing and compiler correctness. In Proc. ICFP, pages 97-108, 2009.
3. Adam Chlipala. A certified type-preserving compiler from lambda calculus to assembly language. In Proc. PLDI, pages 54-65, 2007.
4. Adam Chlipala. Parametric higher-order abstract syntax for mechanized semantics. In Proc. ICFP, pages 143-156, 2008.
5. Olivier Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation. Mathematical Structures in Computer Science, 2 (4):361-391, 1992.
6. Zaynah Dargaye and Xavier Leroy. Mechanized verification of CPS transformations. In Proc. LPAR, pages 211-225, 2007.
7. Maulik A. Dave. Compiler verification: a bibliography. SIGSOFT Softw. Eng. Notes, 28(6):2-2, 2003.
8. 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.
9. David Delahaye. A tactic language for the system Coq. In Proc. LPAR, pages 85-95, 2000.
10. Arthur D. Flatau. A Verified Implementation of an Applicative Language with Dynamic Storage Allocation. PhD thesis, University of Texas at Austin, November 1992.
11. Louis-Julien Guillemette and Stefan Monnier. A type-preserving compiler in Haskell. In Proc. ICFP, pages 75-86, 2008.
12. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. J. of the ACM, 40(1):143-184, 1993.
13. Furio Honsell, Marino Miculan, and Ivan Scagnetto. An axiomatic approach to metareasoning on nominal algebras in HOAS. In Proc. ICALP, pages 963-978, 2001.
14. Xavier Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In Proc. POPL, pages 42-54, 2006.
15. Xavier Leroy and Hervé Grall. Coinductive big-step operational semantics. Inf. Comput., 207(2):284-304, 2009.
16. Yasuhiko Minamide and Koji Okuma. Verifying CPS transformations in Isabelle/HOL. In Proc. MERLIN, pages 1-8, 2003.
17. J Strother Moore. A mechanically verified language implementation. J. Automated Reasoning, 5(4):461-492, 1989.
18. G. Morrisett, M. Felleisen, and R. Harper. Abstract models of memory management. In Proc. FPCA, pages 66-77, 1995.
19. F. Pfenning and C. Elliot. Higher-order abstract syntax. In Proc. PLDI, pages 199-208, 1988.
20. Frank Pfenning and Carsten Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In Proc. CADE, pages 202-206, 1999.
21. Ye Henry Tian. Mechanically verifying correctness of CPS compilation. In Proc. CATS, pages 41-51, 2006.
22. C. Urban and C. Tasson. Nominal techniques in Isabelle/HOL. In Proc. CADE, pages 38-53, 2005.
23. Geoffrey Washburn and Stephanie Weirich. Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism. J. Funct. Program., 18(1):87-140, 2008.
24. Markus Wenzel. Isar - a generic interpretative approach to readable formal proof documents. In Proc. TPHOLs, pages 167-184, 1999.