Decorated proofs for computational effects: States
Programming Languages
2012-09-10 v3 Logic in Computer Science
Category Theory
Abstract
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.
Cite
@article{arxiv.1112.2396,
title = {Decorated proofs for computational effects: States},
author = {Jean-Guillaume Dumas and Dominique Duval and Laurent Fousse and Jean-Claude Reynaud},
journal= {arXiv preprint arXiv:1112.2396},
year = {2012}
}
Comments
In Proceedings ACCAT 2012, arXiv:1208.4301