Decorated proofs for computational effects: Exceptions
Logic in Computer Science
2012-03-15 v1 Category Theory
Abstract
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.
Cite
@article{arxiv.1203.2900,
title = {Decorated proofs for computational effects: Exceptions},
author = {Jean-Guillaume Dumas and Dominique Duval and Laurent Fousse and Jean-Claude Reynaud},
journal= {arXiv preprint arXiv:1203.2900},
year = {2012}
}
Comments
11 pages