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.
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00650269
Contributor : Dominique Duval <>
Submitted on : Tuesday, December 20, 2011 - 3:31:38 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM
Long-term archiving on : Wednesday, March 21, 2012 - 2:50:07 AM

Files

DDFR-proofs-states-v2.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

416

Files downloads

292