Decorated proofs for computational effects: Exceptions
classification
💻 cs.LO
math.CT
keywords
exceptionssystemproofappearclosecomputationaldecorateddefine
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.