Exceptions are an important feature of modern programming languages, but their compilation has traditionally been viewed as an advanced topic. In this article we show that the basic method of compiling exceptions using stack unwinding can be explained and verified both simply and precisely, using elementary functional programming techniques. In particular, we develop a compiler for a small lang...

Models of argumentation often take a given set of rules or conditionals as a starting point. Arguments to support or attack a position are then built from these rules. In this paper, an attempt is made to develop constraints on rules and their exceptions in such a way that they correspond exactly to arguments that successfully support their conclusions. The constraints take the form of properti...

We demonstrate that the Python programming language is not signal-safe, due to Python’s support for raising exceptions from signal handlers. We examine the approaches that various languages have used when dealing with the combination of asynchrony and exception handling, and propose a modification of the Python language that restores signal safety.

We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, changes, in fact, helped us to discover a very important principle guiding how inferences should be drawn in nonmonotonic reasoning, we name it the exception-first principle or EFP. DLEF is our own variant for default logic complying...

We describe a monad for checked, explicitly typed exceptions, which provides as a simple Haskell library what for other languages is a native feature. Multi parameter type classes and overlapping instances are the only essential extensions to Haskell 98 required.