Abstract

. By restriction of Felleisen's control operator F we obtain an operator \Delta and a fully compatible, Church-Rosser control calculus \Delta enjoying a number of desirable properties. It is shown that \Delta contains a strongly normalizing typed subcalculus with a reduction corresponding closely to systems of proof normalization for classical logic. The calculus is more than strong enough to express a call-by-name catch=throw- programming paradigm. 1 Background and motivation The first subsection describes previous work in the Curry-Howard Isomorphism. The second subsection describes our contribution: a typed -calculus with a number of desirable properties, not all shared by the systems mentioned in the first subsection. The Curry-Howard Isomorphism and classical logic. The so-called CurryHoward Isomorphism states a correspondence between typed -calculi and systems of formal logic. 2 At the heart of the isomorphism is the perception of proofs as functions, as formalized ...

Citations