Decorated proofs for computational effects: States

Jean-Guillaume Dumas (1) , Dominique Duval (1) , Laurent Fousse (1) , Jean-Claude Reynaud (2)

1 CASYS - Calculs Algébriques et Systèmes Dynamiques
2 RC - Reynaud Consulting

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.

Mots clés: computational effects; states; proofs; decorated logic; diagrammatic logic

Domaines: Logique en informatique [cs.LO]; Catégories et ensembles [math.CT]

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud. Decorated proofs for computational effects: States. Electronic Proceedings in Theoretical Computer Science, 2012, 93, pp.45-59. ⟨10.4204/EPTCS.93.3⟩. ⟨hal-00650269v2⟩