Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

IMP with exceptions over decorated logic (1503.05496v9)

Published 18 Mar 2015 in cs.LO

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

We haven't generated a summary for this paper yet.