A Type System For Call-By-Name Exceptions

Details A Type System For Call-By-Name Exceptions A Type System For Call-By-Name Exceptions

2009-07-12

arxiv.org/abs/0907.2059v2

LMCS 5 (4:1) 2009

Computer Science

Programming Languages

25 pages

Scientific paper

10.2168/LMCS-5(4:1)2009

We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs that may raise an exception in any evaluation context (not necessarily at top level). We present the syntax and reduction rules of the system, as well as its typing and subtyping rules. We then study its properties, such as confluence. Finally, we construct a realizability model using orthogonality techniques, from which we deduce that well-typed programs are weakly normalizing and that the ones who have the type of natural numbers really compute a natural number, without raising exceptions.

Affiliated with

Also associated with

No associations

Rating

A Type System For Call-By-Name 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 A Type System For Call-By-Name Exceptions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Type System For Call-By-Name Exceptions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-593662