Trace-based coinductive operational semantics for While; Big-step and small-step, relational and functional styles (2009)
| Venue: | In Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, volume 5674 of LNCS |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Nakata09trace-basedcoinductive,
author = {Keiko Nakata and Tarmo Uustalu},
title = {Trace-based coinductive operational semantics for While; Big-step and small-step, relational and functional styles},
booktitle = {In Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, volume 5674 of LNCS},
year = {2009},
pages = {375--390}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semantics and big-step and small-step functional semantics. The semantics employ traces (possibly infinite sequences of states) to record the states that program runs go through. The relational semantics relate statement-state pairs to traces, whereas the functional semantics return traces for statement-state pairs. All four semantics are equivalent. We formalize the semantics and their equivalence proofs in the constructive setting of Coq. 1
