Results 1  10
of
26
Frobenius monads and pseudomonoids
 2CATEGORIES COMPANION 73
, 2004
"... Six equivalent definitions of Frobenius algebra in a monoidal category are provided. In a monoidal bicategory, a pseudoalgebra is Frobenius if and only i f it is star autonomous. Autonomous pseudoalgebras are also Frobenius. What i t means for a morphism of a bicategory to be a projective equivalenc ..."
Abstract

Cited by 39 (4 self)
 Add to MetaCart
(Show Context)
Six equivalent definitions of Frobenius algebra in a monoidal category are provided. In a monoidal bicategory, a pseudoalgebra is Frobenius if and only i f it is star autonomous. Autonomous pseudoalgebras are also Frobenius. What i t means for a morphism of a bicategory to be a projective equivalence is defined; this concept is related to &quot;strongly separable &quot; Frobenius algebras and &quot;weak monoidal Morita equivalence&quot;. Wreath products of Frobenius algebras are discussed.
Categorical structures enriched in a quantaloid: Categories, distributions and functors
 Theory Appl. Categ
"... We study the different guises of the projective objects in Cocont(Q): they are the “completely distributive ” cocomplete Qcategories (the left adjoint to the Yoneda embedding admits a further left adjoint); equivalently, they are the “totally continuous ” cocomplete Qcategories (every object is th ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
We study the different guises of the projective objects in Cocont(Q): they are the “completely distributive ” cocomplete Qcategories (the left adjoint to the Yoneda embedding admits a further left adjoint); equivalently, they are the “totally continuous ” cocomplete Qcategories (every object is the supremum of the presheaf of objects “totally below ” it); and also are they the Qcategories of regular presheaves on a regular Qsemicategory. As a particular case, the Qcategories of presheaves on a Qcategory are precisely the “totally algebraic” cocomplete Qcategories (every object is the supremum of the “totally compact” objects below it). We think that these results should be part of a yettobeunderstood “quantaloidenriched domain theory”. 1
Framed Bicategories and Monoidal Fibrations
, 2007
"... Abstract. In some bicategories, the 1cells are ‘morphisms ’ between the 0cells, such as functors between categories, but in others they are ‘objects ’ over the 0cells, such ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Abstract. In some bicategories, the 1cells are ‘morphisms ’ between the 0cells, such as functors between categories, but in others they are ‘objects ’ over the 0cells, such
THE CHU CONSTRUCTION
, 1996
"... We take another look at the Chu construction and show how to simplify it by looking at ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We take another look at the Chu construction and show how to simplify it by looking at
A UNIFIED FRAMEWORK FOR GENERALIZED MULTICATEGORIES
"... Abstract. Notions of generalized multicategory have been defined in numerous contexts throughout the literature, and include such diverse examples as symmetric multicategories, globular operads, Lawvere theories, and topological spaces. In each case, generalized multicategories are defined as the “l ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. Notions of generalized multicategory have been defined in numerous contexts throughout the literature, and include such diverse examples as symmetric multicategories, globular operads, Lawvere theories, and topological spaces. In each case, generalized multicategories are defined as the “lax algebras ” or “Kleisli monoids ” relative to a “monad ” on a bicategory. However, the meanings of these words differ from author to author, as do the specific bicategories considered. We propose a unified framework: by working with monads on double categories and related structures (rather than bicategories), one can define generalized multicategories in a way that unifies all previous
Monads And Interpolads In Bicategories
, 1997
"... . Given a bicategory, Y , with stable local coequalizers, we construct a bicategory of monads Y mnd by using lax functors from the generic 0cell, 1cell and 2cell, respectively, into Y . Any lax functor into Y factors through Y mnd and the 1cells turn out to be the familiar bimodules. The local ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
(Show Context)
. Given a bicategory, Y , with stable local coequalizers, we construct a bicategory of monads Y mnd by using lax functors from the generic 0cell, 1cell and 2cell, respectively, into Y . Any lax functor into Y factors through Y mnd and the 1cells turn out to be the familiar bimodules. The locally ordered bicategory rel and its bicategory of monads both fail to be Cauchycomplete, but have a wellknown Cauchycompletion in common. This prompts us to formulate a concept of Cauchycompleteness for bicategories that are not locally ordered and suggests a weakening of the notion of monad. For this purpose, we develop a calculus of general modules between unstructured endo1cells. These behave well with respect to composition, but in general fail to have identities. To overcome this problem, we do not need to impose the full structure of a monad on endo1cells. We show that associative coequalizing multiplications suffice and call the resulting structures interpolads. Together with str...
Lax Naturality Through Enrichment
, 1995
"... We develop the relationship between algebraic structure and monads enriched over the monoidal biclosed category LocOrd l of small locally ordered categories, with closed structure given by Lax(A; B). We state the theorem, give a series of examples, and incorporate an account of sketches and cont ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We develop the relationship between algebraic structure and monads enriched over the monoidal biclosed category LocOrd l of small locally ordered categories, with closed structure given by Lax(A; B). We state the theorem, give a series of examples, and incorporate an account of sketches and contravariance into the theory. This was motivated by C.A.R. Hoare's use of category theoretic structures to model data refinement. 1 Introduction In 1987, C.A.R. Hoare wrote a draft paper, "Data refinement in a categorical setting" [10] in which he used category theory to provide an abstract formalism for his development of data refinement over the previous twenty years [9]. The notion of data refinement is central to the programming method called stepwise refinement proposed by Wirth [19], and gave rise to work on abstract data types such as the IOTA programming system developed by Nakajima, Honda and Nakahara [16]. As Hoare said in [10], there was evidently a unified body of category theo...