G. Kahn, Natural semantics, STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, pp.22-39, 1987.
DOI : 10.1007/BFb0039592
URL : https://hal.archives-ouvertes.fr/inria-00075953

G. D. Plotkin, A structural approach to operational semantics, 1981.

G. D. Plotkin, A structural approach to operational semantics, Journal of Logic and Algebraic Programming, vol.60, pp.61-78, 2004.

X. Leroy, Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, in: 33rd symposium Principles of Programming Languages, pp.42-54, 2006.

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

M. Strecker, Compiler verification for C0, Tech. rep, 2005.

T. Hardin, L. Maranget, and B. Pagano, Functional runtime systems within the lambda-sigma calculus, Journal of Functional Programming, vol.8, issue.2, pp.131-176, 1998.
DOI : 10.1017/S0956796898002986
URL : https://hal.archives-ouvertes.fr/hal-01199543

P. Cousot and R. Cousot, Inductive definitions, semantics and abstract interpretations, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.83-94, 1992.
DOI : 10.1145/143165.143184

. Coq-development-team, The Coq proof assistant, software and documentation available from http, 1989.

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

R. Milner and M. Tofte, Co-induction in relational semantics, Theoretical Computer Science, vol.87, issue.1, pp.209-220, 1991.
DOI : 10.1016/0304-3975(91)90033-X

V. Gapeyev, M. Levin, and B. Pierce, Recursive subtyping revealed, Journal of Functional Programming, vol.12, issue.6, pp.511-548, 2003.
DOI : 10.1145/357766.351261
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4619

P. Aczel, An Introduction to Inductive Definitions, Handbook of Mathematical Logic of Studies in Logics and the Foundations of Mathematics, pp.739-782, 1977.
DOI : 10.1016/S0049-237X(08)71120-0

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285
URL : http://projecteuclid.org/download/pdf_1/euclid.pjm/1103044538

B. Courcelle and R. A. , Arbres infinis et syst??mes d'??quations, RAIRO. Informatique th??orique, vol.13, issue.1, pp.31-48, 1979.
DOI : 10.1051/ita/1979130100311

L. Simon, A. Mallya, A. Bansal, and G. Gupta, Coinductive Logic Programming, Logic Programming, 22nd International Conference, pp.330-345, 2006.
DOI : 10.1007/11799573_25

E. Giménez, Codifying guarded definitions with recursive schemes, Lecture Notes in Computer Science, vol.996, pp.39-59, 1994.
DOI : 10.1007/3-540-60579-7_3

X. Leroy and H. , Coinductive big-step operational semantics ? the Coq development, 2007.

A. K. Wright and M. Felleisen, A Syntactic Approach to Type Soundness, Information and Computation, vol.115, issue.1, pp.38-94, 1994.
DOI : 10.1006/inco.1994.1093
URL : http://doi.org/10.1006/inco.1994.1093

M. Tofte, Operational semantics and polymorphic type inference, 1988.

S. Marlow and S. P. Jones, Making a fast curry: push/enter vs. eval/apply for higher-order languages, Journal of Functional Programming, vol.16, pp.4-5, 2006.

P. J. Landin, The Mechanical Evaluation of Expressions, The Computer Journal, vol.6, issue.4, pp.308-320, 1964.
DOI : 10.1093/comjnl/6.4.308

G. Cousineau, P. Curien, and M. Mauny, The categorical abstract machine, Science of Computer Programming, vol.8, issue.2, pp.173-202, 1987.
DOI : 10.1016/0167-6423(87)90020-7

L. Cardelli, The functional abstract machine, Polymorphism Newsletter, vol.1, issue.1

M. Felleisen and D. P. Friedman, Control operators, the SECD machine and the ?calculus , in: Formal Description of Programming Concepts III, pp.131-141, 1986.

M. Rittri, Proving the correctness of a virtual machine by a bisimulation, 1988.

B. Grégoire, Compilation des termes de preuves: un (nouveau) mariage entre Coq et OCaml, 2003.

Y. Bertot, Filters on CoInductive Streams, an Application to Eratosthenes??? Sieve, Lecture Notes in Computer Science, vol.3461, pp.102-115, 2005.
DOI : 10.1007/11417170_9
URL : https://hal.archives-ouvertes.fr/inria-00070658

D. A. Schmidt, Trace-based abstract interpretation of operational semantics, Lisp and Symbolic Computation, pp.237-271, 1998.

J. Hughes and A. Moran, Making choices lazily, Proceedings of the seventh international conference on Functional programming languages and computer architecture , FPCA '95, pp.108-119, 1995.
DOI : 10.1145/224164.224191

R. L. Crole, Lectures on [Co]Induction and [Co]Algebras, Tech. Rep, 1998.

P. Cousot and R. Cousot, Bi-inductive Structural Semantics, Electronic Notes in Theoretical Computer Science, vol.192, issue.1, pp.29-44, 2007.
DOI : 10.1016/j.entcs.2007.08.015
URL : http://doi.org/10.1016/j.ic.2008.03.025

C. A. Gunter and D. Rémy, A proof-theoretic assessment of runtime type errors, 1993.

A. Stoughton, An Operational Semantics Framework Supporting the Incremental Construction of Derivation Trees, Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), pp.122-133, 1998.
DOI : 10.1016/S1571-0661(05)80693-0

X. Leroy and F. Rouaix, Security Properties of Typed Applets, Secure Internet Programming ? Security issues for Mobile and Distributed Objects, pp.147-182, 1999.
DOI : 10.1007/3-540-48749-2_7
URL : https://hal.archives-ouvertes.fr/hal-01499957

A. M. Pitts, Operationally-Based Theories of Program Equivalence, Semantics and Logics of Computation, Publications of the Newton Institute, pp.241-298, 1997.
DOI : 10.1017/CBO9780511526619.007

A. M. Pitts, A co-induction principle for recursively defined domains, Theoretical Computer Science, vol.124, issue.2, pp.195-219, 1994.
DOI : 10.1016/0304-3975(94)90014-0

R. Kennaway, J. W. Klop, M. R. Sleep, and F. Vries, Infinitary lambda calculus, Theoretical Computer Science, vol.175, issue.1, pp.93-125, 1997.
DOI : 10.1016/S0304-3975(96)00171-5
URL : http://doi.org/10.1016/s0304-3975(96)00171-5

A. Berarducci and M. Dezani-ciancaglini, Infinite ??-calculus and types, Theoretical Computer Science, vol.212, issue.1-2, pp.29-75, 1999.
DOI : 10.1016/S0304-3975(98)00135-2
URL : http://doi.org/10.1016/s0304-3975(98)00135-2

X. Leroy, The Compcert verified compiler: commented Coq development, 2008.