Results 1  10
of
26
Categorial Type Logics
 Handbook of Logic and Language
, 1997
"... Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource mana ..."
Abstract

Cited by 239 (5 self)
 Add to MetaCart
Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource management . . . . . . . . . . . . . . . . . . . . . . 13 3 The syntaxsemantics interface: proofs and readings 16 3.1 Term assignment for categorial deductions . . . . . . . . . . . . . . . . . . . . . . . . 17 3.2 Natural language interpretation: the deductive view . . . . . . . . . . . . . . . . . . . 21 4 Grammatical composition: multimodal systems 26 4.1 Mixedinference:themodesofcomposition........................ 26 4.2 Grammaticalcomposition:unaryoperations ....................... 30 4.2.1 Unary connectives: logic and structure . . . . . . . . . . . . . . . . . . . . . . . 31 4.2.2 Applications: imposing constraints, structural relaxation
Categorical Logic
 A CHAPTER IN THE FORTHCOMING VOLUME VI OF HANDBOOK OF LOGIC IN COMPUTER SCIENCE
, 1995
"... ..."
Possible Worlds and Resources: The Semantics of BI
 THEORETICAL COMPUTER SCIENCE
, 2003
"... The logic of bunched implications, BI, is a substructural system which freely combines an additive (intuitionistic) and a multiplicative (linear) implication via bunches (contexts with two combining operations, one which admits Weakening and Contraction and one which does not). BI may be seen to a ..."
Abstract

Cited by 47 (18 self)
 Add to MetaCart
The logic of bunched implications, BI, is a substructural system which freely combines an additive (intuitionistic) and a multiplicative (linear) implication via bunches (contexts with two combining operations, one which admits Weakening and Contraction and one which does not). BI may be seen to arise from two main perspectives. On the one hand, from prooftheoretic or categorical concerns and, on the other, from a possibleworlds semantics based on preordered (commutative) monoids. This semantics may be motivated from a basic model of the notion of resource. We explain BI's prooftheoretic, categorical and semantic origins. We discuss in detail the question of completeness, explaining the essential distinction between BI with and without ? (the unit of _). We give an extensive discussion of BI as a semantically based logic of resources, giving concrete models based on Petri nets, ambients, computer memory, logic programming, and money.
Closed categories generated by commutative monads
 J. Austral. Math. Soc
, 1971
"... The notion of commutative monad was denned by the author in [4]. The ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
The notion of commutative monad was denned by the author in [4]. The
Normal Forms and CutFree Proofs as Natural Transformations
 in : Logic From Computer Science, Mathematical Science Research Institute Publications 21
, 1992
"... What equations can we guarantee that simple functional programs must satisfy, irrespective of their obvious defining equations? Equivalently, what nontrivial identifications must hold between lambda terms, thoughtof as encoding appropriate natural deduction proofs ? We show that the usual syntax g ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
What equations can we guarantee that simple functional programs must satisfy, irrespective of their obvious defining equations? Equivalently, what nontrivial identifications must hold between lambda terms, thoughtof as encoding appropriate natural deduction proofs ? We show that the usual syntax guarantees that certain naturality equations from category theory are necessarily provable. At the same time, our categorical approach addresses an equational meaning of cutelimination and asymmetrical interpretations of cutfree proofs. This viewpoint is connected to Reynolds' relational interpretation of parametricity ([27], [2]), and to the KellyLambekMac LaneMints approach to coherence problems in category theory. 1 Introduction In the past several years, there has been renewed interest and research into the interconnections of proof theory, typed lambda calculus (as a functional programming paradigm) and category theory. Some of these connections can be surprisingly subtle. Here we a...
Metric, Topology and Multicategory  A Common Approach
 J. Pure Appl. Algebra
, 2001
"... For a symmetric monoidalclosed category V and a suitable monad T on the category of sets, we introduce the notion of reflexive and transitive (T , V)algebra and show that various old and new structures are instances of such algebras. Lawvere's presentation of a metric space as a Vcategory is incl ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
For a symmetric monoidalclosed category V and a suitable monad T on the category of sets, we introduce the notion of reflexive and transitive (T , V)algebra and show that various old and new structures are instances of such algebras. Lawvere's presentation of a metric space as a Vcategory is included in our setting, via the BettiCarboniStreetWalters interpretation of a Vcategory as a monad in the bicategory of Vmatrices, and so are Barr's presentation of topological spaces as lax algebras, Lowen's approach spaces, and Lambek's multicategories, which enjoy renewed interest in the study of ncategories. As a further example, we introduce a new structure called ultracategory which simultaneously generalizes the notions of topological space and of category.
Quantum informationflow, concretely, abstractly
 PROC. QPL 2004
, 2004
"... These ‘lecture notes ’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatization of the ‘quantum info ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
These ‘lecture notes ’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatization of the ‘quantum informationflow ’ which enables protocols such as quantum teleportation. 1 To this means we defined strongly compact closed categories which abstractly capture the behavioral properties of quantum entanglement. • ‘Postulates for an abstract quantum formalism ’ in which classical informationflow (e.g. token exchange) is part of the formalism. As an example, we provided a purely formal description of quantum teleportation and proved correctness in abstract generality. 2 In this formalism types reflect kinds, contra the essentially typeless von Neumann formalism [25]. Hence even concretely this formalism manifestly improves on the usual one. • ‘A highlevel approach to quantum informatics’. 3 Indeed, the above discussed work can be conceived as aiming to solve: von Neumann quantum formalism � highlevel language lowlevel language. I also provide a brief discussion on how classical and quantum uncertainty can be mixed in the above formalism (cf. density matrices). 4
! and ?  Storage as tensorial strength
, 1996
"... this paper were produced with the help of the diagram macros of F. Borceux. Blute, Cockett, & Seely 2 ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
this paper were produced with the help of the diagram macros of F. Borceux. Blute, Cockett, & Seely 2
Explicit Substitution Internal Languages for Autonomous and *Autonomous Categories
 In Proc. Category Theory and Computer Science (CTCS'99), Electron
, 1999
"... We introduce a family of explicit substitution type theories as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the simplytyped calculus with surjective pairing is the internal language for cartesian closed categories. We show tha ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We introduce a family of explicit substitution type theories as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the simplytyped calculus with surjective pairing is the internal language for cartesian closed categories. We show that the eight equality and three commutation congruence axioms of the autonomous type theory characterise autonomous categories exactly. The associated rewrite systems are all strongly normalising; modulo a simple notion of congruence, they are also confluent. As a corollary, we solve a Coherence Problem a la Lambek [12]: the equality of maps in any autonomous category freely generated from a discrete graph is decidable. 1 Introduction In this paper we introduce a family of type theories which can be regarded as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the standard simplytyped calculus with surjective pairing is...
Opmonoidal Monads
, 2002
"... Hopf monads are identified with monads in the 2category OpMon of monoidal categories, opmonoidal functors and transformations. Using EilenbergMoore objects, it is shown that for a Hopf monad S, the categories Alg(Coalg(S)) and Coalg(Alg(S)) are canonically isomorphic. The monadic arrows OpMon are ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Hopf monads are identified with monads in the 2category OpMon of monoidal categories, opmonoidal functors and transformations. Using EilenbergMoore objects, it is shown that for a Hopf monad S, the categories Alg(Coalg(S)) and Coalg(Alg(S)) are canonically isomorphic. The monadic arrows OpMon are then characterized. Finally, the theory of multicategories and a generalization of structure and semantics are used to identify the categories of algebras of Hopf monads.