2000 character limit reached
Decorated proofs for computational effects: States (1112.2396v3)
Published 11 Dec 2011 in cs.PL, cs.LO, and math.CT
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.