Results 11  20
of
52
Distributive laws for the coinductive solution of recursive equations
 Information and Computation
"... This paper illustrates the relevance of distributive laws for the solution of recursive equations, and shows that one approach for obtaining coinductive solutions of equations via infinite terms is in fact a special case of a more general approach using an extended form of coinduction via distributi ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This paper illustrates the relevance of distributive laws for the solution of recursive equations, and shows that one approach for obtaining coinductive solutions of equations via infinite terms is in fact a special case of a more general approach using an extended form of coinduction via distributive laws. 1
Understanding the small object argument
 Applied Categorical Structures
, 2008
"... The small object argument is a transfinite construction which, starting from a set of maps in a category, generates a weak factorisation system on that ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The small object argument is a transfinite construction which, starting from a set of maps in a category, generates a weak factorisation system on that
Distributive Laws For Pseudomonads
 T. A. C
, 1999
"... . We define distributive laws between pseudomonads in a Graycategory A, as the classical two triangles and the two pentagons but commuting only up to isomorphism. These isomorphisms must satisfy nine coherence conditions. We also define the Graycategory PSM(A) of pseudomonads in A, and define a l ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
. We define distributive laws between pseudomonads in a Graycategory A, as the classical two triangles and the two pentagons but commuting only up to isomorphism. These isomorphisms must satisfy nine coherence conditions. We also define the Graycategory PSM(A) of pseudomonads in A, and define a lifting to be a pseudomonad in PSM(A). We define what is a pseudomonad with compatible structure with respect to two given pseudomonads. We show how to obtain a pseudomonad with compatible structure from a distributive law, how to get a lifting from a pseudomonad with compatible structure, and how to obtain a distributive law from a lifting. We show that one triangle suffices to define a distributive law in case that one of the pseudomonads is a (co)KZdoctrine and the other a KZdoctrine. 1. Introduction Distributive laws for monads were introduced by J. Beck in [2]. As pointed out by G. M. Kelly in [7], strict distributive laws for higher dimensional monads are rare. We need then a study ...
The double powerlocale and exponentiation: A case study in geometric reasoning, Theory and Applications of Categories 12
 School of Computer Science, University of Birmingham
, 2004
"... Abstract. If X is a locale, then its double powerlocale PX is defined to be PU(PL(X)) where PU and PL are the upper and lower powerlocale constructions. We prove various results relating it to exponentiation of locales, including the following. First, if X is a locale for which the exponential SX ex ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
Abstract. If X is a locale, then its double powerlocale PX is defined to be PU(PL(X)) where PU and PL are the upper and lower powerlocale constructions. We prove various results relating it to exponentiation of locales, including the following. First, if X is a locale for which the exponential SX exists (where S is the Sierpinski locale), then PX is an exponential SSX. Second, if in addition W is a locale for which PW is homeomorphic to S X, then X is an exponential S W. The work uses geometric reasoning, i.e. reasoning stable under pullback along geometric morphisms, and this enables the locales to be discussed in terms of their points as though they were spaces. It relies on a number of geometricity results including those for locale presentations and for powerlocales. 1.
Cofibrantly generated natural weak factorisation systems
, 2007
"... There is an “algebraisation ” of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of mapswithstructure, where the extra structure on a map now encodes a choice of liftings with r ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
There is an “algebraisation ” of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of mapswithstructure, where the extra structure on a map now encodes a choice of liftings with respect to the other class. This extra structure has pleasant consequences: for example, a natural w.f.s. on C induces a canonical natural w.f.s. structure on any functor category [A, C]. In this paper, we define cofibrantly generated natural weak factorisation systems by analogy with cofibrantly generated w.f.s.’s. We then construct them by a method which is reminiscent of Quillen’s small object argument but produces factorisations which are much smaller and easier to handle, and show that the resultant natural w.f.s. is, in a suitable sense, freely generated by its generating cofibrations. Finally, we show that the two categories of mapswithstructure for a natural w.f.s. are closed under all the constructions we would expect of them: (co)limits, pushouts / pullbacks, transfinite composition, and so on. 1
A 2categories companion
"... Abstract. This paper is a rather informal guide to some of the basic theory of 2categories and bicategories, including notions of limit and colimit, 2dimensional universal algebra, formal category theory, and nerves of bicategories. 1. Overview and basic examples This paper is a rather informal gu ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. This paper is a rather informal guide to some of the basic theory of 2categories and bicategories, including notions of limit and colimit, 2dimensional universal algebra, formal category theory, and nerves of bicategories. 1. Overview and basic examples This paper is a rather informal guide to some of the basic theory of 2categories and bicategories, including notions of limit and colimit, 2dimensional universal algebra, formal category theory, and nerves of bicategories. As is the way of these things, the choice of topics is somewhat personal. No attempt is made at either rigour or completeness. Nor is it completely introductory: you will not find a definition of bicategory; but then nor will you really need one to read it. In keeping with the philosophy of category theory, the morphisms between bicategories play more of a role than the bicategories themselves. 1.1. The key players. There are bicategories, 2categories, and Catcategories. The latter two are exactly the same (except that strictly speaking a Catcategory should have small homcategories, but that need not concern us here). The first two are nominally different — the 2categories are the strict bicategories, and not every bicategory is strict — but every bicategory is biequivalent to a strict one, and biequivalence is the right general notion of equivalence for bicategories and for 2categories. Nonetheless, the theories of bicategories, 2categories, and Catcategories have rather different flavours.
Operads, clones, and distributive laws
, 2008
"... Abstract We show how nonsymmetric operads (or multicategories), symmetric operads, and clones, arise from three suitable monads on Cat, each extending to a monad on profunctors thanks to a distributivelaw. The presentation builds upon recent work by Fiore, Gambino, Hyland, and Winskel on a theory ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract We show how nonsymmetric operads (or multicategories), symmetric operads, and clones, arise from three suitable monads on Cat, each extending to a monad on profunctors thanks to a distributivelaw. The presentation builds upon recent work by Fiore, Gambino, Hyland, and Winskel on a theory of generalized species of structures,but, for the multicategory case, the general idea goes back to Burroni's Tcategories (1971). We show how other previous categorical analysesof operad (via Day's tensor products, or via analytical functor) fit with the profunctor approach.
Monad interleaving: a construction of the operad for Leinster’s weak ωcategories, Preprint, 2003, available at http://arxiv.org/abs/math/0309336
"... We show how to “interleave ” the monad for operads and the monad for contractions on the category Coll of collections, to construct the monad for the operadswithcontraction of Leinster. We first decompose the adjunction for operads and the adjunction for contractions into a chain of adjunctions ea ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We show how to “interleave ” the monad for operads and the monad for contractions on the category Coll of collections, to construct the monad for the operadswithcontraction of Leinster. We first decompose the adjunction for operads and the adjunction for contractions into a chain of adjunctions each of which acts on only one dimension of the underlying globular sets at a time. We then exhibit mutual stability conditions that enable us to alternate the dimensionbydimension free functors. Hence we give an explicit construction of a left adjoint