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. © 2012 J.-G. Dumas, D. Duval, L. Fousse & J.-C. Reynaud.
Cite
CITATION STYLE
APA
Dumas, J. G., Duval, D., Fousse, L., & Reynaud, J. C. (2012). Decorated proofs for computational effects: States. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 93, pp. 45–59). Open Publishing Association. https://doi.org/10.4204/EPTCS.93.3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free