Results 1  10
of
57
Minimal Classical Logic and Control Operators
 In ICALP: Annual International Colloquium on Automata, Languages and Programming, volume 2719 of LNCS
, 2003
"... 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. ..."
Abstract

Cited by 39 (4 self)
 Add to MetaCart
(Show Context)
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.
L.: Constructing free Boolean categories
, 2005
"... By Boolean category we mean something which is to a Boolean algebra what a category is to a poset. We propose an axiomatic system for Boolean categories, which is different in several respects from the ones proposed recently. In particular everything is done from the start in a *autonomous category ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
(Show Context)
By Boolean category we mean something which is to a Boolean algebra what a category is to a poset. We propose an axiomatic system for Boolean categories, which is different in several respects from the ones proposed recently. In particular everything is done from the start in a *autonomous category and not in a weakly distributive one, which simplifies issues like the Mix rule. An important axiom, which is introduced later, is a “graphical ” condition, which is closely related to denotational semantics and the Geometry of Interaction. Then we show that a previously
On the unity of duality
 Special issue on “Classical Logic and Computation
, 2008
"... Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception. As type systems become more precise, however, detailed properties of the operational semantics may become visible becaus ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception. As type systems become more precise, however, detailed properties of the operational semantics may become visible because properties captured by the types may be sound under one strategy but not the other. For example, intersection types distinguish between callbyname and callbyvalue functions, because the subtyping law (A → B) ∩ (A → C) ≤ A → (B ∩ C) is unsound for the latter in the presence of effects. In this paper we develop a prooftheoretic framework for analyzing the interaction of types with evaluation order, based on the notion of polarity. Polarity was discovered through linear logic, but we propose a fresh origin in Dummett’s program of justifying the logical laws through alternative verificationist or pragmatist “meaningtheories”, which include a bias towards either introduction or elimination rules. We revisit Dummett’s analysis using the tools of MartinLöf’s judgmental method, and then show how to extend it to a unified polarized logic, with Girard’s “shift ” connectives acting as intermediaries. This logic safely combines intuitionistic and dual intuitionistic reasoning principles, while simultaneously admitting a focusing interpretation for the classical sequent calculus. Then, by applying the CurryHoward isomorphism to polarized logic, we obtain a single programming language in which evaluation order is reflected at the level of types. Different logical notions correspond directly to natural programming constructs, such as patternmatching, explicit substitutions, values and callbyvalue continuations. We give examples demonstrating the expressiveness of the language and type system, and prove a basic but modular type safety result. We conclude with a brief discussion of extensions to the language with additional effects and types, and sketch the sort of explanation this can provide for operationallysensitive typing phenomena. 1
On the axiomatisation of boolean categories with and without medial
 THEORY APPL. CATEG
, 2007
"... ..."
Callbyvalue is dual to callbyname reloaded
 In Term rewriting and applications. Lecture Notes in Comput. Sci
, 2005
"... ..."
2005, ‘A ProofTheoretic Foundation of Abortive Continuations (Extended version
"... 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 comp ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
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.
Answer type polymorphism in callbyname continuation passing
 In Proc. European Symposium on Programming, Springer Lecture Notes in Comput. Sci
, 2004
"... Abstract. This paper studies continuations by means of a polymorphic type system. The traditional callbyname continuation passing style transform admits a typing in which some answer types are polymorphic, even in the presence of firstclass control operators. By building on this polymorphic typin ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional callbyname continuation passing style transform admits a typing in which some answer types are polymorphic, even in the presence of firstclass control operators. By building on this polymorphic typing, and using parametricity reasoning, we show that the callbyname transform satisfies the etalaw, and is in fact isomorphic to the more recent CPS transform defined by Streicher. 1
Relational parametricity and control
 Logical Methods in Computer Science
"... www.lmcsonline.org ..."
(Show Context)