Decorated proofs for computational effects: States

Abstract

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. 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.

DOI: 10.4204/EPTCS.93.3

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Dumas2011DecoratedPF, title={Decorated proofs for computational effects: States}, author={Jean-Guillaume Dumas and Dominique Duval and Laurent Fousse and Jean-Claude Reynaud}, booktitle={ACCAT}, year={2011} }