Results 1  10
of
102
Notions of Computation and Monads
, 1991
"... The i.calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with Iterms. However, if one goes further and uses bnconversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with ..."
Abstract

Cited by 733 (15 self)
 Add to MetaCart
The i.calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with Iterms. However, if one goes further and uses bnconversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with total functions from calues to values) that may jeopardise the applicability of theoretical results, In this paper we introduce calculi. based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs for a wide range of notions of computation.
Towards a Mathematical Operational Semantics
 In Proc. 12 th LICS Conf
, 1997
"... We present a categorical theory of `wellbehaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transformation ..."
Abstract

Cited by 134 (9 self)
 Add to MetaCart
We present a categorical theory of `wellbehaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transformation of a suitable general form, depending on functorial notions of syntax and behaviour, then one gets both an operational model and a canonical, internally fully abstract denotational model for free; moreover, both models satisfy the operational rules. The theory is based on distributive laws and bialgebras; it specialises to the known classes of wellbehaved rules for structural operational semantics, such as GSOS.
A Mixed Linear and NonLinear Logic: Proofs, Terms and Models (Preliminary Report)
, 1994
"... Intuitionistic linear logic regains the expressive power of intuitionistic logic through the ! (`of course') modality. Benton, Bierman, Hyland and de Paiva have given a term assignment system for ILL and an associated notion of categorical model in which the ! modality is modelled by a comonad satis ..."
Abstract

Cited by 94 (3 self)
 Add to MetaCart
Intuitionistic linear logic regains the expressive power of intuitionistic logic through the ! (`of course') modality. Benton, Bierman, Hyland and de Paiva have given a term assignment system for ILL and an associated notion of categorical model in which the ! modality is modelled by a comonad satisfying certain extra conditions. Ordinary intuitionistic logic is then modelled in a cartesian closed category which arises as a full subcategory of the category of coalgebras for the comonad. This paper attempts to explain the connection between ILL and IL more directly and symmetrically by giving a logic, term calculus and categorical model for a system in which the linear and nonlinear worlds exist on an equal footing, with operations allowing one to pass in both directions. We start from the categorical model of ILL given by Benton, Bierman, Hyland and de Paiva and show that this is equivalent to having a symmetric monoidal adjunction between a symmetric monoidal closed category and a cartesian closed category. We then derive both a sequent calculus and a natural deduction presentation of the logic corresponding to the new notion of model.
Structural Induction and Coinduction in a Fibrational Setting
 Information and Computation
, 1997
"... . We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle for in ..."
Abstract

Cited by 67 (14 self)
 Add to MetaCart
. We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle for initial algebras is admissible, and dually, in the presence of quotient types, the coinduction principle for terminal coalgebras is admissible. After giving an alternative formulation of induction in terms of binary relations, we combine both principles and obtain a mixed induction/coinduction principle which allows us to reason about minimal solutions X = oe(X) where X may occur both positively and negatively in the type constructor oe. We further strengthen these logical principles to deal with contexts and prove that such strengthening is valid when the (abstract) logic we consider is contextually/functionally complete. All the main results follow from a basic result about adjunc...
From subfactors to categories and topology I. Frobenius algebras in and Morita equivalence of tensor categories
 J. Pure Appl. Alg
, 2003
"... We consider certain categorical structures that are implicit in subfactor theory. Making the connection between subfactor theory (at finite index) and category theory explicit sheds light on both subjects. Furthermore, it allows various generalizations of these structures, e.g. to arbitrary ground f ..."
Abstract

Cited by 52 (6 self)
 Add to MetaCart
We consider certain categorical structures that are implicit in subfactor theory. Making the connection between subfactor theory (at finite index) and category theory explicit sheds light on both subjects. Furthermore, it allows various generalizations of these structures, e.g. to arbitrary ground fields, and the proof of new results about topological invariants in three dimensions. The central notion is that of a Frobenius algebra in a tensor category A, which reduces to the classical notion if A = FVect, where F is a field. An object X ∈ A with twosided dual X gives rise to a Frobenius algebra in A, and under weak additional conditions we prove a converse: There exists a bicategory E with ObjE = {A, B} such that EndE(A) ⊗ ≃ A and such that there are J, J: B ⇋ A producing the given Frobenius algebra. Many properties (additivity, sphericity, semisimplicity,...) of A carry over to the bicategory E. We define weak monoidal Morita equivalence of tensor categories, denoted A ≈ B, and establish a correspondence between Frobenius algebras in A and tensor categories B ≈ A. While considerably weaker than equivalence of tensor categories, weak monoidal Morita equivalence A ≈ B has remarkable consequences: A and B have equivalent (as braided tensor categories) quantum doubles (‘centers’) and (if A, B are semisimple spherical or ∗categories) have equal dimensions and give rise the same state sum invariant of closed oriented 3manifolds as recently defined by Barrett and Westbury. An instructive example is provided by finite dimensional semisimple and cosemisimple Hopf algebras, for which we prove H − mod ≈ ˆH − mod. The present formalism permits a fairly complete analysis of the center of a semisimple spherical category, which is the subject of the companion paper math.CT/0111205. 1
Representable Multicategories
 Advances in Mathematics
, 2000
"... We introduce the notion of representable multicategory , which stands in the same relation to that of monoidal category as bration does to contravariant pseudofunctor (into Cat). We give an abstract reformulation of multicategories as monads in a suitable Kleisli bicategory of spans. We describe ..."
Abstract

Cited by 33 (6 self)
 Add to MetaCart
We introduce the notion of representable multicategory , which stands in the same relation to that of monoidal category as bration does to contravariant pseudofunctor (into Cat). We give an abstract reformulation of multicategories as monads in a suitable Kleisli bicategory of spans. We describe representability in elementary terms via universal arrows . We also give a doctrinal characterisation of representability based on a fundamental monadic adjunction between the 2category of multicategories and that of strict monoidal categories. The first main result is the coherence theorem for representable multicategories, asserting their equivalence to strict ones, which we establish via a new technique based on the above doctrinal characterisation. The other main result is a 2equivalence between the 2category of representable multicategories and that of monoidal categories and strong monoidal functors. This correspondence extends smoothly to one between bicategories and a se...
Operads In HigherDimensional Category Theory
, 2004
"... The purpose of this paper is to set up a theory of generalized operads and multicategories and to use it as a language in which to propose a definition of weak ncategory. Included is a full explanation of why the proposed definition of ncategory is a reasonable one, and of what happens when n <= 2 ..."
Abstract

Cited by 32 (2 self)
 Add to MetaCart
The purpose of this paper is to set up a theory of generalized operads and multicategories and to use it as a language in which to propose a definition of weak ncategory. Included is a full explanation of why the proposed definition of ncategory is a reasonable one, and of what happens when n <= 2. Generalized operads and multicategories play other parts in higherdimensional algebra too, some of which are outlined here: for instance, they can be used to simplify the opetopic approach to ncategories expounded by Baez, Dolan and others, and are a natural language in which to discuss enrichment of categorical structures.
Combining effects: sum and tensor
"... We seek a unified account of modularity for computational effects. We begin by reformulating Moggi’s monadic paradigm for modelling computational effects using the notion of enriched Lawvere theory, together with its relationship with strong monads; this emphasises the importance of the operations ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
We seek a unified account of modularity for computational effects. We begin by reformulating Moggi’s monadic paradigm for modelling computational effects using the notion of enriched Lawvere theory, together with its relationship with strong monads; this emphasises the importance of the operations that produce the effects. Effects qua theories are then combined by appropriate bifunctors on the category of theories. We give a theory for the sum of computational effects, which in particular yields Moggi’s exceptions monad transformer and an interactive input/output monad transformer. We further give a theory of the commutative combination of effects, their tensor, which yields Moggi’s sideeffects monad transformer. Finally we give a theory of operation transformers, for redefining operations when adding new effects; we derive explicit forms for the operation transformers associated to the above monad transformers.
A dialecticalike model of linear logic
 In Proc. Conf. on Category Theory and Computer Science, LNCS 389
, 1989
"... The aim of this work is to define the categories GC, describe their categorical structure and show they are a model of Linear Logic. The second goal is to relate those categories to the Dialectica categories DC, cf.[DCJ, using different functors for the exponential “of course”. It is hoped that this ..."
Abstract

Cited by 27 (6 self)
 Add to MetaCart
The aim of this work is to define the categories GC, describe their categorical structure and show they are a model of Linear Logic. The second goal is to relate those categories to the Dialectica categories DC, cf.[DCJ, using different functors for the exponential “of course”. It is hoped that this categorical model of Linear Logic should help us to get a better understanding of the logic, which is, perhaps, the first nonintuitionistic constructive logic. This work is divided in two parts, each one with 3 sections. The first section shows that GC is a monoidal closed category and describes bifunctors for tensor “0”, internal horn “[—, —]“, par “u”, cartesian products “& “ and coproducts “s”. The second section defines linear negation as a contravariant functor obtained evaluating the internal horn bifunctor at a “dualising object”. The third section makes explicit the connections with Linear Logic, while the fourth introduces the comonads used to model the connective “of course”. Section 5 discusses some properties of these cornonads and finally section 6 makes the logical connections once more. This work grew out of suggestions of J.Y. Girard at the AMSConference on Categories, Logic and Computer Science in Boulder 1987, where I presented my earlier work on the Dialectica categories, hence the title. Still on the lines of given credit where it is due, I would like to say that Martin Hyland, under whose supervision this work was written, has been a continuous source of ideas and inspiration. Many heartfelt thanks to him. 1. The main definitions We start with a finitely complete category C. Then to describe GC say that its objects are relations on objects of C, that is monics A ~ U x X, which we usually write as (U ~ X). Given two such objects, (U ~ X) and (V L Y), which we call simply A and B, a morphism from A to B consists of a pair of maps in C, f: U — * V and F 4 Y —+ X, such that a pullback condition is satisfied, namely that where (~~)_1 represents puilbacks. (U x F) 1 (o~) ~ (f x Y) 1 (/3), (1) 342 Using diagrams, we say (f,F) is a morphism in GC if there is a (unique) map in ~, k: A ’ —~B ’ making the triangle commute: a~I Ia
Monads on Tensor Categories
 J. Pure Appl. Algebra
, 2002
"... this paper we will discuss the combination of two classical notions of category theory, both treated extensively in [CWM]. One of these is the notion of a monad or triple on a category, which goes back to Godement [G] and was rst developed by Eilenberg, Moore, Beck and others. The other is that of a ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
this paper we will discuss the combination of two classical notions of category theory, both treated extensively in [CWM]. One of these is the notion of a monad or triple on a category, which goes back to Godement [G] and was rst developed by Eilenberg, Moore, Beck and others. The other is that of a monoidal category or tensor category, which originates with Benabou [Be] and with Mac Lane's famous coherence theorem [MacL], and which pervades much of present day mathematics. For a monad S on a tensor category, there is a natural additional structure that one can impose, namely that of a comparison map S(X