Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991. ,
DOI : 10.1016/0304-3975(86)90035-6
Compiling with continuations, 1992. ,
DOI : 10.1017/CBO9780511609619
Mechanized Metatheory for the Masses: The PoplMark Challenge, Int. Conf. on Theorem Proving in Higher Order Logics (TPHOLs), pp.50-65, 2005. ,
DOI : 10.1007/11541868_4
Interactive Theorem Proving and Program Development ? Coq'Art: The Calculus of Inductive Constructions. EATCS Texts in Theoretical Computer Science, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00344237
Formal Verification of a C Compiler Front-End, FM 2006: Int. Symp. on Formal Methods, pp.460-475, 2006. ,
DOI : 10.1007/11813040_31
URL : https://hal.archives-ouvertes.fr/inria-00106401
A certified type-preserving compiler from lambda calculus to assembly language, Programming Language Design and Implementation 2007, pp.54-65, 2007. ,
A first-order one-pass CPS transformation, Theoretical Computer Science, vol.308, issue.1-3, pp.239-257, 2003. ,
DOI : 10.1016/S0304-3975(02)00733-8
CPS transformation of beta-redexes, Information Processing Letters, vol.94, issue.5, pp.217-224, 2005. ,
DOI : 10.1016/j.ipl.2005.02.002
Décurryfication certifiée, Journées Francophones des Langages Applicatifs (JFLA'07). INRIA, 2007. ,
Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indag. Math, vol.34, issue.5, pp.381-392, 1972. ,
The essence of compiling with continuations, Programming Language Design and Implementation 1993, pp.237-247, 1993. ,
Compiling with continuations, continued, International Conference on Functional Programming, 2007. ,
DOI : 10.1145/1291151.1291179
A machine-checked model for a Java-like language, virtual machine, and compiler, ACM Transactions on Programming Languages and Systems, vol.28, issue.4, pp.619-695, 2006. ,
DOI : 10.1145/1146809.1146811
Orbit, SIGPLAN '86 symposium on Compiler Construction, pp.219-233, 1986. ,
DOI : 10.1145/989393.989414
Towards the formal verification of a C0 compiler: code generation and implementation correctness, Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05), pp.2-11, 2005. ,
DOI : 10.1109/SEFM.2005.51
Coinductive Big-Step Operational Semantics, European Symposium on Programming, pp.54-68, 2006. ,
DOI : 10.1006/inco.1994.1093
URL : https://hal.archives-ouvertes.fr/inria-00309010
Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, 33rd symposium Principles of Programming Languages, pp.42-54, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00000963
A New Extraction for Coq, Types for Proofs and Programs, pp.200-219, 2002. ,
DOI : 10.1007/3-540-39185-1_12
URL : https://hal.archives-ouvertes.fr/hal-00150914
Verifying CPS transformations in Isabelle/HOL, Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding , MERLIN '03, pp.1-8, 2003. ,
DOI : 10.1145/976571.976576
Piton: a mechanically verified assembly-language, 1996. ,
Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975. ,
DOI : 10.1016/0304-3975(75)90017-1
A reflection on call-by-value, ACM Transactions on Programming Languages and Systems, vol.19, issue.6, pp.916-941, 1997. ,
DOI : 10.1145/267959.269968
Mechanically verifying correctness of CPS compilation, CATS '06: Proceedings of the 12th Computing: The Australasian Theory Symposium, pp.41-51, 2006. ,
Nominal techniques in Isabelle/HOL, Journal of Automated Reasoning, 2007. ,