Coinductive big-step operational semantics
| dc.creator | Leroy, Xavier | |
| dc.creator | Grall, Hervé | |
| dc.date | 2008-08-05 | |
| dc.date.accessioned | 2026-07-07T09:54:43Z | |
| dc.date.available | 2026-07-07T09:54:43Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0808.0586 | |
| dc.identifier | http://arxiv.org/abs/0808.0586 | |
| dc.identifier | Information and Computation (2007) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166422 | |
| dc.subject | Programming Languages | |
| dc.title | Coinductive big-step operational semantics | |
| dc.type | text |