Decorated proofs for computational effects: Exceptions

Details Decorated proofs for computational effects: Exceptions Decorated proofs for computational effects: Exceptions

2012-03-13

arxiv.org/abs/1203.2900v1

Computer Science

Logic in Computer Science

11 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Decorated proofs for computational effects: Exceptions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decorated proofs for computational effects: Exceptions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decorated proofs for computational effects: Exceptions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-145337