Decorated proofs for computational effects: States

Abstract : The syntax of an imperative language does not mention explicitely 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

https://hal.archives-ouvertes.fr/hal-00828544
Contributor : Dominique Duval <>
Submitted on : Friday, May 31, 2013 - 11:39:56 AM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM

Identifiers

  • HAL Id : hal-00828544, version 1

Données associées

Collections

Citation

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud. Decorated proofs for computational effects: States. ACCAT, 2012, -, Estonia. ⟨hal-00828544⟩

Share

Metrics

Record views

227