Papers
Topics
Authors
Recent
Search
2000 character limit reached

IMP with exceptions over decorated logic

Published 18 Mar 2015 in cs.LO | (1503.05496v9)

Abstract: In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with decorations' that describe what computational (side) effect evaluation of a term may involve. In a point-free categorical language,called thedecorated logic', we formalize the mutable state and the exception effects first separately, exploiting anice duality between them, and then combined. The combined decorated logic is used as the target language forthe denotational semantics of the IMP+Exc imperative programming language, and allows us to prove equivalencesbetween programs written in IMP+Exc. The combined logic is encoded in Coq, and this encoding is used to certifysome program equivalence proofs.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.