Abstract

The catch/throw mechanism is a programming construct for non-local exit. In the practical programming, this mechanism plays an important role when programmers handle exceptional situations. In this paper we give a constructive formalization which captures the mechanism in the proofs-as-programs notion. We introduce a modified version of LJ equipped with inference rules corresponding to the operations of catch and throw. Then we show that we can actually extract programs which make use of the catch/throw mechanism from proofs under a certain realizability interpretation. Although the catch/throw mechanism provides only a restricted access to the current continuation, the formulation remains constructive in contrast to the works due to Griffin and Murthy on more powerful facilities such as call/cc (call-with-current-continuation) of Scheme.

Citations

299	The mechanical evaluation of expressions - Landin - 1964
219	Call-by-name, call-by-value, and the -calculus - Plotkin - 1975
210	Common Lisp: The Language - Steele - 1990
206	A formulae-as-types notion of control - Griffin - 1990
105	A Syntactic Theory of Sequential Control - Felleisen, Friedman, et al. - 1987
41	An evaluation semantics for classical proofs - Murthy - 1991
21	Vollständige Systeme modaler und intuitionistischer Logik - Schütte - 1968
18	The Design of Well-Structured and Correct Programs - Alagic, Arbib - 1978
7	The C Programming Language, 2nd ed - Kernighan, Ritchie - 1988
3	Proof theory (2nd - Takeuti - 1987
2	Eine Darstellung intuitionistic Logik und der - Maehara - 1954