Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Clouston, Ranald"'
The intuitionistic modal logics considered between Constructive K (CK) and Intuitionistic K (IK) differ in their treatment of the possibility (diamond) connective. It was recently rediscovered that some logics between CK and IK also disagree on their
Externí odkaz:
http://arxiv.org/abs/2408.00262
We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and fo
Externí odkaz:
http://arxiv.org/abs/1910.05215
Autor:
Birkedal, Lars, Clouston, Ranald, Mannaa, Bassel, Møgelberg, Rasmus Ejlers, Pitts, Andrew M., Spitters, Bas
Publikováno v:
Math. Struct. Comp. Sci. 30 (2020) 118-138
In recent years we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and clocked type theory, and spatial and cohesive type theory. In this paper we study
Externí odkaz:
http://arxiv.org/abs/1804.05236
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that manipulate resources such as memory locations. These logics are "abstract" because they are independent of any particular concrete resource model.
Externí odkaz:
http://arxiv.org/abs/1710.10805
Autor:
Clouston, Ranald
Fitch-style modal deduction, in which modalities are eliminated by opening a subordinate proof, and introduced by shutting one, were investigated in the 1990s as a basis for lambda calculi. We show that such calculi have good computational properties
Externí odkaz:
http://arxiv.org/abs/1710.08326
Autor:
Birkedal, Lars, Bizjak, Aleš, Clouston, Ranald, Grathwohl, Hans Bugge, Spitters, Bas, Vezzosi, Andrea
This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of program lo
Externí odkaz:
http://arxiv.org/abs/1611.09263
Publikováno v:
Logical Methods in Computer Science, Volume 12, Issue 3 (April 27, 2017) lmcs:2019
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive types may be
Externí odkaz:
http://arxiv.org/abs/1606.09455
Autor:
Birkedal, Lars, Bizjak, Aleš, Clouston, Ranald, Grathwohl, Hans Bugge, Spitters, Bas, Vezzosi, Andrea
This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of program lo
Externí odkaz:
http://arxiv.org/abs/1606.05223
We present guarded dependent type theory, gDTT, an extensional dependent type theory with a `later' modality and clock quantifiers for programming and proving with guarded recursive and coinductive types. The later modality is used to ensure the prod
Externí odkaz:
http://arxiv.org/abs/1601.01586