Verifying CPS transformations in Isabelle/HOL

Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2003

Volumn , Issue , 2003, Pages

  Minamide, Yasuhiko ^a   Okuma, Koji ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Correctness proofs; Program transformation; Theorem proving

Indexed keywords

BINS; SYNTACTICS;

ABSTRACT SYNTAX; ALPHA-EQUIVALENCE; CORRECTNESS PROOFS; DEDUCTIVE SYSTEMS; FIRST ORDER; PARAMETERIZED; PROGRAM TRANSFORMATIONS; THEOREM PROVERS;

THEOREM PROVING;

EID: 84975745170     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/976571.976576     Document Type: Conference Paper

References (19)

1. S. Ambler and R. L. Crole. Mechanized operational semantics via (co) induction. In Proceedings of 12th International Conference on Theorem Proving in Higher Order Logics, volume 1690 of LNCS, pages 221-238, 1999.
2. A. W. Appel. Compiling with Continuation. Cambridge University Press, 1992.
3. O. Danvy, B. Dzafic, and F. Pfenning. On proving syntactic properties of CPS programs. In Proceedings of International Workshop on Higher Order Operational Techniques in Semantics, volume 26 of ENTCS, 1999.
4. O. Danvy and A. Filinski. Representing control: a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
5. O. Danvy and L. R. Nielsen. A first-order one-pass CPS transformation. In Proceedings of Foundations of Software Science and Computation Structures, FOSSACS, volume 2303 of LNCS, pages 98-113, 2002.
6. N. De Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae, 34:381-391, 1972.
7. J. Despeyroux and A. Hirschowitz. Higher-order syntax and induction in Coq. In F. Pfenning, editor, Proceedings of the Fifth International Conference on Logic Programming and Automated Reasoning (LPAR), volume 822 of LNAI, pages 159-173, 1994.
8. J. Hannan and F. Pfenning. Compiler verification in LF. In Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pages 407-418, 1992.
9. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, 1993.
10. J. McKinna and R. Pollack. Some lambda calculus and type theory formalized. Journal of Automated Reasoning, 23:373-409, 1999.
11. T. Nipkow. More Church-Rosser proofs (in Isabelle/HOL). Journal of Automated Reasoning, 26:51-66, 2001.
12. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer-Verlag, 2002.
13. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.
14. F. Pfenning. Logic programming in the LF logical framework. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 149-181. Cambridge University Press, 1991.
15. F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN'88 Symposium on Language Design and Implementation, pages 199-208, 1988.
16. G. D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1(2):125-159, December 1975.
17. G. L. Steele Jr. Rabbit: A compiler for Scheme. Master's thesis, MIT, 1978.
18. R. Vestergaard and J. Brotherston. A formalised first-order confluence proof for the λ-calculus using one-sorted variable names (Barendregt was right after all... almost). In Proceedings of the 12th International Conference Rewriting Techniques and Applications, volume 2051 of LNCS, pages 306-321, 2001.
19. M. Wenzel. Isar - a generic interpretative approach to readable formal proof documents. In Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics, volume 1690 of LNCS, pages 167-183, 1999.