@article{RISC5980,author = {William Steingartner and Valerie Novitzká and Wolfgang Schreiner},
title = {{A Coalgebraic Operational Semantics for an Imperative Language}},
language = {english},
abstract = {Operational semantics is a known and popular semantic method for
describing the execution of programs in detail. The traditional definition of this
method defines each step of a program as a transition relation. We present a new
approach on how to define operational semantics as a coalgebra over a category of
configurations. Our approach enables us to deal with a program that is written in a
small but real imperative language containing also the common program constructs
as input and output statements, and declarations. A coalgebra enables to define
operational semantics in a uniform way and it describes the behavior of the programs.
The state space of our coalgebra consists of the configurations modeling the
actual states; the morphisms in a base category of the coalgebra are the functions
defining particular steps during the program’s executions. Polynomial endofunctor
determines this type of systems. Another advantage of our approach is its easy implementation
and graphical representation, which we illustrate on a simple program.},
journal = {Computing and Informatics},
pages = {--},
isbn_issn = {ISSN 1335-9150},
year = {2019},
note = {To appear},
refereed = {yes},
length = {28}
}