Decorated proofs for computational effects: States

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.

In Proceedings ACCAT 2012, arXiv:1208.4301

References in corpus (3)

• Breaking a monad-comonad symmetry between computational effects
• States and exceptions considered as dual effects
• Adjunctions for exceptions

Cited by in corpus (3)

• Certified proofs in programs involving exceptions
• Decorated proofs for computational effects: Exceptions
• Scalability using effects