Decorated proofs for computational effects: Exceptions

Jean-Guillaume Dumas (1) , Dominique Duval (1) , Laurent Fousse (1) , Jean-Claude Reynaud (2)

1 CASYS - Calculs Algébriques et Systèmes Dynamiques
2 RC - Reynaud Consulting

We define a proof system for exceptions which is close to the syntax for exceptions, in the sense that the exceptions do not appear explicitly in the type of any expression. This proof system is sound with respect to the intended denotational semantics of exceptions. With this inference system we prove several properties of exceptions.

Keywords: Semantics of exceptions; Proof system.; Proof system; Computational effects

Domains: Logic in Computer Science [cs.LO]; Category Theory [math.CT]

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud. Decorated proofs for computational effects: Exceptions. [Research Report] Université Grenoble Alpes (UGA). 2012. ⟨hal-00678738⟩