Results 1  10
of
33
A typetheoretic foundation of delimited continuations. Higher Order Symbol
 Comput
, 2009
"... Abstract. There is a correspondence between classical logic and programming language calculi with firstclass continuations. With the addition of control delimiters, the continuations become composable and the calculi become more expressive. We present a finegrained analysis of control delimiters a ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
Abstract. There is a correspondence between classical logic and programming language calculi with firstclass continuations. With the addition of control delimiters, the continuations become composable and the calculi become more expressive. We present a finegrained analysis of control delimiters and formalise that their addition corresponds to the addition of a single dynamicallyscoped variable modelling the special toplevel continuation. From a type perspective, the dynamicallyscoped variable requires effect annotations. In the presence of control, the dynamicallyscoped variable can be interpreted in a purely functional way by applying a storepassing style. At the type level, the effect annotations are mapped within standard classical logic extended with the dual of implication, namely subtraction. A continuationpassingstyle transformation of lambdacalculus with control and subtraction is defined. Combining the translations provides a decomposition of standard CPS transformations for delimited continuations. Incidentally, we also give a direct normalisation proof of the simplytyped lambdacalculus with control and subtraction.
Cutelimination and proofsearch for biintuitionistic logic using nested sequents
, 2008
"... We propose a new sequent calculus for biintuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cutelimination proof as do display calculi. But it has an easily derivable variant cal ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
(Show Context)
We propose a new sequent calculus for biintuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cutelimination proof as do display calculi. But it has an easily derivable variant calculus which is amenable to automated proof search as are (some) traditional sequent calculi. We first present the initial calculus and its cutelimination proof. We then present the derived calculus, and then present a proofsearch strategy which allows it to be used for automated proof search. We prove that this search strategy is terminating and complete by showing how it can be used to mimic derivations obtained from an existing calculus GBiInt for biintuitionistic logic. As far as we know, our new calculus is the first sequent calculus for biintuitionistic logic which uses no semantic additions like labels, which has a purely syntactic cutelimination proof, and which can be used naturally for backwards proofsearch.
Callbyvalue is dual to callbyname reloaded
 In Term rewriting and applications. Lecture Notes in Comput. Sci
, 2005
"... Abstract. We consider the relation of the dual calculus of Wadler (2003) to the λµcalculus of Parigot (1992). We give translations from the λµcalculus into the dual calculus and back again. The translations form an equational correspondence as defined by Sabry and Felleisen (1993). In particular, ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. We consider the relation of the dual calculus of Wadler (2003) to the λµcalculus of Parigot (1992). We give translations from the λµcalculus into the dual calculus and back again. The translations form an equational correspondence as defined by Sabry and Felleisen (1993). In particular, translating from λµ to dual and then ‘reloading ’ from dual back into λµ yields a term equal to the original term. Composing the translations with duality on the dual calculus yields an involutive notion of duality on the λµcalculus. A previous notion of duality on the λµcalculus has been suggested by Selinger (2001), but it is not involutive. Note This paper uses color to clarify the relation of types and terms, and of source and target calculi. If the URL below is not in blue please download the color version from
Combining Derivations and Refutations for Cutfree Completeness in BiIntuitionistic Logic
, 2008
"... Biintuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cutfree ” sequent calculus has recently been shown to fail cutelimination. We present a new cutfree se ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Biintuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cutfree ” sequent calculus has recently been shown to fail cutelimination. We present a new cutfree sequent calculus for biintuitionistic logic, and prove it sound and complete with respect to its Kripke semantics. Ensuring completeness is complicated by the interaction between intuitionistic implication and dual intuitionistic exclusion, similarly to future and past modalities in tense logic. Our calculus handles this interaction using derivations and refutations as first class citizens. We employ extended sequents which pass information from premises to conclusions using variables instantiated at the leaves of refutations, and rules which compose certain refutations and derivations to form derivations. Automated deduction using terminating backward search is also possible, although this is not our main purpose. 1
A TERM ASSIGNMENT FOR DUAL INTUITIONISTIC LOGIC.
"... Abstract. We study the prooftheory of coHeyting algebras and present a calculus of continuations typed in the disjunctive–subtractive fragment of dual intuitionistic logic. We give a singleassumption multipleconclusions Natural Deduction system NJ � � for this logic: unlike the bestknown treatm ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We study the prooftheory of coHeyting algebras and present a calculus of continuations typed in the disjunctive–subtractive fragment of dual intuitionistic logic. We give a singleassumption multipleconclusions Natural Deduction system NJ � � for this logic: unlike the bestknown treatments of multipleconclusion systems (e.g., Parigot’s λ−µ calculus, or Urban and Bierman’s termcalculus) here the termassignment is distributed to all conclusions, and exhibits several features of calculi for concurrency, such as remote capture of variable and remote substitution. The present construction can be regarded as the construction of a free coCartesian
A cutfree sequent calculus for biintuitionistic logic: extended version
, 2007
"... Abstract. Biintuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Biintuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cutfree ” sequent calculus for BiInt has recently been s ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Biintuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Biintuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cutfree ” sequent calculus for BiInt has recently been shown by Uustalu to fail cutelimination. We present a new cutfree sequent calculus for BiInt, and prove it sound and complete with respect to its Kripke semantics. Ensuring completeness is complicated by the interaction between implication and its dual, similarly to future and past modalities in tense logic. Our calculus handles this interaction using extended sequents which pass information from premises to conclusions using variables instantiated at the leaves of failed derivation trees. Our simple termination argument allows our calculus to be used for automated deduction, although this is not its main purpose. 1
Deep inference in Biintuitionistic logic
 In Int Workshop on Logic, Language, Information and Computation, WoLLIC 2009, LNAI 5514
, 2009
"... Abstract. Biintuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cutelimination in biintuitionistic logic is complicated due to the interaction between these two connectives, and various extended sequent calculi, including a display calcu ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. Biintuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cutelimination in biintuitionistic logic is complicated due to the interaction between these two connectives, and various extended sequent calculi, including a display calculus, have been proposed to address this problem. In this paper, we present a new extended sequent calculus DBiInt for biintuitionistic logic which uses nested sequents and “deep inference”, i.e., inference rules can be applied at any level in the nested sequent. We show that DBiInt can simulate our previous “shallow ” sequent calculus LBiInt. In particular, we show that deep inference can simulate the residuation rules in the displaylike shallow calculus LBiInt. We also consider proof search and give a simple restriction of DBiInt which allows terminating proof search. Thus our work is another step towards addressing the broader problem of proof search in display logic. 1
Categorical Proof Theory of CoIntuitionistic Linear Logic
"... Summary. To provide a categorical semantics for cointuitionistic logic, one has to face the fact, noted by Tristan Crolard, that the definition of coexponents as adjuncts of coproducts does not work in the category Set, where coproducts are disjoint unions. Following the familiar construction of ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Summary. To provide a categorical semantics for cointuitionistic logic, one has to face the fact, noted by Tristan Crolard, that the definition of coexponents as adjuncts of coproducts does not work in the category Set, where coproducts are disjoint unions. Following the familiar construction of models of intuitionistic linear logic with exponent!, we build models of cointuitionistic logic in symmetric monoidal closed categories with additional structure, using a variant of Crolard’s term assignment to cointuitionistic logic in the construction of a free category. 1
A Parigotstyle linear λcalculus for Full intuitionistic Linear Logic
, 2005
"... This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles classical l ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles classical logic in that its sequentcalculus formulation has intrinsic multiple conclusions. From the intrinsic multiple conclusions comes the inspiration to modify Parigot’s natural deduction systems for classical logic, to produce a natural deduction formulation and a term assignment system for FILL. keywords: linear logic, λµcalculus, CurryHoward isomorphism 1
hypotheses, conjectures and expectations. Rough set semantics and prooftheory
 Advances in Natural Deduction
, 2013
"... Summary. In this paper biintuitionism is interpreted as an intensional logic which is about the justification conditions of assertions and hypotheses, extending C. Dalla Pozza and C. Garola’s pragmatic interpretation [18] of intuitionism, seen as a logic of assertions according to a suggestion by M ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Summary. In this paper biintuitionism is interpreted as an intensional logic which is about the justification conditions of assertions and hypotheses, extending C. Dalla Pozza and C. Garola’s pragmatic interpretation [18] of intuitionism, seen as a logic of assertions according to a suggestion by M. Dummett. Revising our previous work on this matter [5], we consider two additional illocutionary forces, (i) conjecturing, seen as making the hypotheses that a proposition is epistemically necessary, and (ii) expecting, regarded as asserting that a propostion is epistemically possible; we show that a logic of expectations justifies the double negation law. We formalize our logic in a calculus of sequents and study bimodal Kripke semantics of biintuitionism based on translations in S4. We look at rough set semantics following P. Pagliani’s analysis of “intrinsic coHeyting boundaries ” [40] (after Lawvere). A Natural Deduction system for cointuitionistic logic is given where proofs are represented as upside down Prawitz trees. We give a computational interpretation of cointuitionism, based on T. Crolard’s notion of coroutine [16] as the programming construction corresponding to subtraction introduction. Our typed calculus of coroutines is dual to