Decorated proofs for computational effects: States
classification
💻 cs.PL
cs.LOmath.CT
keywords
imperativelanguagementionproofsstatesyntaxcomputationaldecorated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.