Decorated proofs for computational effects: States

Jean-Guillaume Dumas
(LJK, Université de Grenoble, France)
Dominique Duval
(LJK, Université de Grenoble, France)
Laurent Fousse
(LJK, Université de Grenoble, France)
Jean-Claude Reynaud
(LJK, Université de Grenoble, France)

The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we show that the equational proofs about an imperative language may hide the state, in the same way as the syntax does.

In Ulrike Golas and Thomas Soboll: Proceedings Seventh ACCAT Workshop on Applied and Computational Category Theory (ACCAT 2012), Tallinn, Estonia, 01/04/2012, Electronic Proceedings in Theoretical Computer Science 93, pp. 45–59.
Published: 21st August 2012.

ArXived at: http://dx.doi.org/10.4204/EPTCS.93.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org