M. Abadi, L. Cardelli, P. Curien, and J. Lévy, Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991.
DOI : 10.1016/0304-3975(86)90035-6

A. W. Appel, Compiling with continuations, 1992.
DOI : 10.1017/CBO9780511609619

B. E. Aydemir, A. Bohannon, M. Fairbairn, J. N. Foster, B. C. Pierce et al., 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

Y. Bertot and P. Castéran, 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

S. Blazy, Z. Dargaye, and X. Leroy, 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. Chlipala, A certified type-preserving compiler from lambda calculus to assembly language, Programming Language Design and Implementation 2007, pp.54-65, 2007.

O. Danvy and L. R. Nielsen, 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

O. Danvy and L. R. Nielsen, CPS transformation of beta-redexes, Information Processing Letters, vol.94, issue.5, pp.217-224, 2005.
DOI : 10.1016/j.ipl.2005.02.002

Z. Dargaye, Décurryfication certifiée, Journées Francophones des Langages Applicatifs (JFLA'07). INRIA, 2007.

N. G. De-bruijn, 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.

C. Flanagan, A. Sabry, B. Duba, and M. Felleisen, The essence of compiling with continuations, Programming Language Design and Implementation 1993, pp.237-247, 1993.

A. Kennedy, Compiling with continuations, continued, International Conference on Functional Programming, 2007.
DOI : 10.1145/1291151.1291179

G. Klein and T. Nipkow, 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

D. Kranz, N. Adams, R. Kelsey, J. Rees, P. Hudak et al., Orbit, SIGPLAN '86 symposium on Compiler Construction, pp.219-233, 1986.
DOI : 10.1145/989393.989414

D. Leinenbach, W. Paul, and E. Petrova, 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

X. Leroy, 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

X. Leroy, 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

P. Letouzey, 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

Y. Minamide and K. Okuma, 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

J. S. Moore, Piton: a mechanically verified assembly-language, 1996.

G. D. Plotkin, 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. Sabry and P. Wadler, 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

Y. H. Tian, Mechanically verifying correctness of CPS compilation, CATS '06: Proceedings of the 12th Computing: The Australasian Theory Symposium, pp.41-51, 2006.

C. Urban, Nominal techniques in Isabelle/HOL, Journal of Automated Reasoning, 2007.