Results 1 
6 of
6
Logical Predicates for Intuitionistic Linear Type Theories
 In Typed Lambda Calculi and Applications (TLCA'99), Lecture Notes in Computer Science 1581
, 1999
"... We develop a notion of Kripkelike parameterized logical predicates for two fragments of intuitionistic linear logic (MILL and DILL) in terms of their categorytheoretic models. Such logical predicates are derived from the categorical glueing construction combined with the free symmetric monoidal co ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
(Show Context)
We develop a notion of Kripkelike parameterized logical predicates for two fragments of intuitionistic linear logic (MILL and DILL) in terms of their categorytheoretic models. Such logical predicates are derived from the categorical glueing construction combined with the free symmetric monoidal cocompletion. As applications, we obtain full completeness results of translations between linear type theories.
A Semantic Formulation of ⊤⊤lifting and Logical Predicates for Computational Metalanguage
 In Proc. CSL 2005. LNCS 3634
, 2005
"... Abstract. A semantic formulation of Lindley and Stark’s ⊤⊤lifting is given. We first illustrate our semantic formulation of the ⊤⊤lifting in Set with several examples, and apply it to the logical predicates for Moggi’s computational metalanguage. We then abstract the semantic ⊤⊤lifting as the lif ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. A semantic formulation of Lindley and Stark’s ⊤⊤lifting is given. We first illustrate our semantic formulation of the ⊤⊤lifting in Set with several examples, and apply it to the logical predicates for Moggi’s computational metalanguage. We then abstract the semantic ⊤⊤lifting as the lifting of strong monads across bifibrations with lifted symmetric monoidal closed structures. 1
Girard Translation and Logical Predicates
, 2000
"... We present a short proof of a folklore result: the Girard translation from the simply typed lambda calculus to the linear lambda calculus is fully complete. The proof makes use of a notion of logical predicates for intuitionistic linear logic. While the main result is of independent interest, this p ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We present a short proof of a folklore result: the Girard translation from the simply typed lambda calculus to the linear lambda calculus is fully complete. The proof makes use of a notion of logical predicates for intuitionistic linear logic. While the main result is of independent interest, this paper can be read as a tutorial on this proof technique for reasoning about relations between type theories.
A CATEGORICAL MODEL OF PREDICATE LINEAR LOGIC
, 2015
"... Abstract. Linear logic is one of the logical systems with special properties suitable for describing real processes used in computer science. It enables one to specify dynamics, non determinism, consecutive processes and important resources as memory and time on syntactic level. Moreover, its deduc ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Linear logic is one of the logical systems with special properties suitable for describing real processes used in computer science. It enables one to specify dynamics, non determinism, consecutive processes and important resources as memory and time on syntactic level. Moreover, its deduction system enables one to verify specified properties. Constructing an appropriate model based on categories can serve for modeling various program systems in the wide spectrum of computer science. Mainly, propositional linear logic is used for these purposes. The expression power of linear logic significantly grows by extending propositional logic with predicates and quantifiers. Our paper concerns itself with defining predicate linear logic together with its deduction system and our main aim is to construct a categorical model of predicate linear logic as a symmetric monoidal closed category.
Web www.itu.dk Categorical Models of PILL
, 1600
"... All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. ISSN 1600–6100 ISBN 8779490875 Copies may be obtained by contacting: ..."
Abstract
 Add to MetaCart
All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. ISSN 1600–6100 ISBN 8779490875 Copies may be obtained by contacting:
Glueing Algebraic Structures on a 2Category
, 2000
"... We study the glueing constructions (comma objects) on general algebraic structures on a 2category, described in terms of 2monads and adjunctions. Specifically, lifting theorems for the comma objects and changeofbase results on both algebras of 2monads and adjunctions in a 2category are present ..."
Abstract
 Add to MetaCart
We study the glueing constructions (comma objects) on general algebraic structures on a 2category, described in terms of 2monads and adjunctions. Specifically, lifting theorems for the comma objects and changeofbase results on both algebras of 2monads and adjunctions in a 2category are presented. As a leading example, we take the 2monad on Cat whose algebras are symmetric monoidal categories, and show that many of the constructions in our previous work on models of linear type theories can be derived within this axiomatics. 1 Introduction In the previous work [2, 3] we have considered a glueing construction for symmetric monoidal (closed) categories, for studying the logical predicates for models of linear type theories. In that construction the glueing functor is supposed to be lax symmetric monoidal, thus preserves the structure only up to a few coherent morphisms, not up to isomorphisms or identity. From a view of the study of categories with algebraic structures [8] (which...