Coinductive big-step operational semantics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2009

Coinductive big-step operational semantics


Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating evaluations. We formalize the connections between the coinductive big-step semantics and the standard small-step semantics, proving that both semantics are equivalent. We then study the use of coinductive big-step semantics in proofs of type soundness and proofs of semantic preservation for compilers. A methodological originality of this paper is that all results have been proved using the Coq proof assistant. We explain the proof-theoretic presentation of coinductive definitions and proofs offered by Coq, and show that it facilitates the discovery and the presentation of the results.
Fichier principal
Vignette du fichier
leroy-grall.pdf (292.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00309010 , version 1 (05-08-2008)



Xavier Leroy, Hervé Grall. Coinductive big-step operational semantics. Information and Computation, 2009, 207 (2), pp.284-304. ⟨10.1016/j.ic.2007.12.004⟩. ⟨inria-00309010⟩
482 View
392 Download



Gmail Mastodon Facebook X LinkedIn More