Decorated proofs for computational effects: States

Details Decorated proofs for computational effects: States Decorated proofs for computational effects: States

2011-12-11

arxiv.org/abs/1112.2396v2

Computer Science

Programming Languages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Decorated proofs for computational effects: States does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decorated proofs for computational effects: States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decorated proofs for computational effects: States will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708115