1,102 research outputs found
Monads in Double Categories
We extend the basic concepts of Street's formal theory of monads from the
setting of 2-categories to that of double categories. In particular, we
introduce the double category Mnd(C) of monads in a double category C and
define what it means for a double category to admit the construction of free
monads. Our main theorem shows that, under some mild conditions, a double
category that is a framed bicategory admits the construction of free monads if
its horizontal 2-category does. We apply this result to obtain double
adjunctions which extend the adjunction between graphs and categories and the
adjunction between polynomial endofunctors and polynomial monads.Comment: 30 pages; v2: accepted for publication in the Journal of Pure and
Applied Algebra; added hypothesis in Theorem 3.7 that source and target
functors preserve equalizers; on page 18, bottom, in the statement concerning
the existence of a left adjoint, "if and only if" was replaced by "a
sufficient condition"; acknowledgements expande
Restriction categories III: colimits, partial limits, and extensivity
A restriction category is an abstract formulation for a category of partial
maps, defined in terms of certain specified idempotents called the restriction
idempotents. All categories of partial maps are restriction categories;
conversely, a restriction category is a category of partial maps if and only if
the restriction idempotents split. Restriction categories facilitate reasoning
about partial maps as they have a purely algebraic formulation.
In this paper we consider colimits and limits in restriction categories. As
the notion of restriction category is not self-dual, we should not expect
colimits and limits in restriction categories to behave in the same manner. The
notion of colimit in the restriction context is quite straightforward, but
limits are more delicate. The suitable notion of limit turns out to be a kind
of lax limit, satisfying certain extra properties.
Of particular interest is the behaviour of the coproduct both by itself and
with respect to partial products. We explore various conditions under which the
coproducts are ``extensive'' in the sense that the total category (of the
related partial map category) becomes an extensive category. When partial
limits are present, they become ordinary limits in the total category. Thus,
when the coproducts are extensive we obtain as the total category a lextensive
category. This provides, in particular, a description of the extensive
completion of a distributive category.Comment: 39 page
Enriched Lawvere Theories for Operational Semantics
Enriched Lawvere theories are a generalization of Lawvere theories that allow
us to describe the operational semantics of formal systems. For example, a
graph enriched Lawvere theory describes structures that have a graph of
operations of each arity, where the vertices are operations and the edges are
rewrites between operations. Enriched theories can be used to equip systems
with operational semantics, and maps between enriching categories can serve to
translate between different forms of operational and denotational semantics.
The Grothendieck construction lets us study all models of all enriched theories
in all contexts in a single category. We illustrate these ideas with the
SKI-combinator calculus, a variable-free version of the lambda calculus.Comment: In Proceedings ACT 2019, arXiv:2009.0633
Unguarded Recursion on Coinductive Resumptions
We study a model of side-effecting processes obtained by starting from a
monad modelling base effects and adjoining free operations using a cofree
coalgebra construction; one thus arrives at what one may think of as types of
non-wellfounded side-effecting trees, generalizing the infinite resumption
monad. Correspondingly, the arising monad transformer has been termed the
coinductive generalized resumption transformer. Monads of this kind have
received some attention in the recent literature; in particular, it has been
shown that they admit guarded iteration. Here, we show that they also admit
unguarded iteration, i.e. form complete Elgot monads, provided that the
underlying base effect supports unguarded iteration. Moreover, we provide a
universal characterization of the coinductive resumption monad transformer in
terms of coproducts of complete Elgot monads.Comment: 47 pages, extended version of
http://www.sciencedirect.com/science/article/pii/S157106611500079
- …