[PRL] [1112.2396] Decorated proofs for computational effects: States

[Mitchell Wand]

No clue about content, but interesting abstract...  --MitchDecorated proofs
for computational effects: States
Jean-Guillaume Dumas <http://arxiv.org/find/cs/1/au:+Dumas_J/0/1/0/all/0/1>
 (LJK), Dominique Duval<http://arxiv.org/find/cs/1/au:+Duval_D/0/1/0/all/0/1>
 (LJK), Laurent Fousse<http://arxiv.org/find/cs/1/au:+Fousse_L/0/1/0/all/0/1>
 (LJK), Jean-Claude
Reynaud<http://arxiv.org/find/cs/1/au:+Reynaud_J/0/1/0/all/0/1>
 (RC)
(Submitted on 11 Dec 2011)

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.

Subjects:Programming Languages (cs.PL)Cite
as:arXiv:1112.2396v1<http://arxiv.org/abs/1112.2396v1>
 [cs.PL]

Link: http://arxiv.org/abs/1112.2396 (sent via Shareaholic)

----
-------------- next part --------------
HTML attachment scrubbed and removed