IMP with exceptions over decorated logic

Burak Ekici (1)

1 CASYS - Calculs Algébriques et Systèmes Dynamiques

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 the “decorated logic”, we formalize the mutable state and the exception effects first separately, and then combined, exploiting a nice duality between them. The combined decorated logic is used as the target language for the denotational semantics of the IMP+Exc imperative programming language, and allows us to prove equivalences between programs written in IMP+Exc. The combined logic is encoded in Coq, and this encoding is used to certify some program equivalence proofs.

Mots clés: computational effects; state; exceptions; program equivalence proofs; decorated logic; Coq

Domaines: Logique en informatique [cs.LO]

Burak Ekici. IMP with exceptions over decorated logic. 2017. ⟨hal-01132831v3⟩