Higher-Order and Symbolic Computation

, Volume 20, Issue 4, pp 403–429

A proof-theoretic foundation of abortive continuations

Article

DOI: 10.1007/s10990-007-9007-z

Cite this article as:
Ariola, Z.M., Herbelin, H. & Sabry, A. Higher-Order Symb Comput (2007) 20: 403. doi:10.1007/s10990-007-9007-z

Abstract

We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce’s law without enforcing Ex Falso Quodlibet. We show that a “natural” implementation of this logic is Parigot’s classical natural deduction. We then move on to the computational side and emphasize that Parigot’s λμ corresponds to minimal classical logic. A continuation constant must be added to λμ to get full classical logic. The extended calculus is isomorphic to a syntactical restriction of Felleisen’s theory of control that offers a more expressive reduction semantics. This isomorphic calculus is in correspondence with a refined version of Prawitz’s natural deduction.

Keywords

CallccMinimal logicIntuitionistic logicClassical logic

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.University of OregonEugeneUSA
  2. 2.INRIA-FutursOrsayFrance
  3. 3.Indiana UniversityBloomingtonUSA