Polymorphic type inference and containment
Information and Computation - Semantics of Data Types
A functional theory of exceptions
Science of Computer Programming
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Notions of computation and monads
Information and Computation
Type-based analysis of uncaught exceptions
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A semantics for imprecise exceptions
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
The marriage of effects and monads
ACM Transactions on Computational Logic (TOCL)
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
Semantic types: a fresh look at the ideal model for types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
An intuitionistic λ-calculus with exceptions
Journal of Functional Programming
| Hi-index | 0.00 |
We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type $A {\rlap{{*}}\cup} \{\varepsilon\}$ for programs of type Awhose execution may raise the exception 茂戮驴at top level, and a corruption typeA(茂戮驴)for programs that may raise the 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.