Computer Science – Programming Languages
Scientific paper
2008-08-05
Information and Computation (2007)
Computer Science
Programming Languages
Scientific paper
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.
Grall Hervé
Leroy Xavier
No associations
LandOfFree
Coinductive big-step operational semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Coinductive big-step operational semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coinductive big-step operational semantics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-549918