English
Related papers

Related papers: The costructure-cosemantics adjunction for comodel…

200 papers

Type-and-effect systems incorporate information about the computational effects, e.g., state mutation, probabilistic choice, or I/O, a program phrase may invoke alongside its return value. A semantics for type-and-effect systems involves a…

Programming Languages · Computer Science 2018-04-11 Ohad Kammar , Dylan McDermott

We extend Bourke and Garner's idempotent adjunction between monads and pretheories to the framework of $\infty$-categories and we use this to prove many classical results about monads in the $\infty$-categorical framework. Amongst other…

Category Theory · Mathematics 2021-06-17 Simon Henry , Nicholas J. Meadows

We extend intersection types to a computational $\lambda$-calculus with algebraic operations \`a la Plotkin and Power. We achieve this by considering monadic intersections, whereby computational effects appear not only in the operational…

Programming Languages · Computer Science 2024-01-24 Francesco Gavazzo , Riccardo Treglia , Gabriele Vanoni

It is known that the so-called monadic decomposition, applied to the adjunction connecting the category of bialgebras to the category of vector spaces via the tensor and the primitive functors, returns the usual adjunction between…

Category Theory · Mathematics 2021-02-15 Alessandro Ardizzoni , Claudia Menini

We introduce an enriched notion of a coalgebra over an operad P in a symmetric monoidal V-category C. When C is semicartesian and P is unital, we construct a V-endofunctor on C associated to P and give conditions under which it is a…

Category Theory · Mathematics 2026-05-04 Oisín Flynn-Connolly

Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial parameters of structures. In this paper, we develop a framework whereby the…

Logic in Computer Science · Computer Science 2024-02-14 Samson Abramsky , Luca Reggio

Our work over the past years shows that not only the collection of (for instance) all topological spaces gives rise to a category, but also each topological space can be seen individually as a category by interpreting the convergence…

Category Theory · Mathematics 2008-04-03 Dirk Hofmann

We show that single-variable polynomial functors over the category $\mathcal{S}$ of infinity groupoids, as defined by Gepner-Haugseng-Kock, are exactly colimits of representable copresheaves indexed by infinity groupoid. This allows us to…

Algebraic Topology · Mathematics 2026-02-02 Kun Chen

To a coarse structure we associate a Grothendieck topology which is determined by coarse covers. A coarse map between coarse spaces gives rise to a morphism of Grothendieck topologies. This way we define sheaves and sheaf cohomology on…

Algebraic Geometry · Mathematics 2022-03-24 Elisa Hartmann

This paper lays some of the foundations for working with not-necessarily-commutative bialgebras and their categories of comodules in $\infty$-categories. We prove that the categories of comodules and modules over a bialgebra always admit…

Algebraic Topology · Mathematics 2021-08-20 Jonathan Beardsley

We apply the Acyclicity Theorem of Hess, Kerdziorek, Riehl, and Shipley (recently corrected by Garner, Kedziorek, and Riehl) to establishing the existence of model category structure on categories of coalgebras over comonads arising from…

Algebraic Topology · Mathematics 2018-08-15 Kathryn Hess , Magdalena Kedziorek

In this work, we establish certain enrichments of dual algebraic structures in the setting of monoidal double categories. In more detail, we obtain a tensored and cotensored enrichment of monads in comonads, as well as a tensored and…

Category Theory · Mathematics 2025-02-04 Vasileios Aravantinos-Sotiropoulos , Christina Vasilakopoulou

Functor lifting along a fibration is used for several different purposes in computer science. In the theory of coalgebras, it is used to define coinductive predicates, such as simulation preorder and bisimilarity. Codensity lifting is a…

Logic in Computer Science · Computer Science 2021-02-09 Yuichi Komorida

Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads have been suggested which provide a more fine-grained model…

Programming Languages · Computer Science 2020-05-04 Dominic Orchard , Philip Wadler , Harley Eades

We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…

Logic · Mathematics 2014-02-28 Richard Garner

In arXiv:1712.00555, H. Heine shows that given a symmetric monoidal $\infty$-category $\mathcal{V}$ and a weakly $\mathcal{V}$-enriched monad $T$ over an $\infty$-category $\mathcal{C}$, then there is an induced action of $\mathcal{V}$ on…

Category Theory · Mathematics 2024-08-01 Federico Ernesto Mocchetti

In category theory, monads, which are monoid objects on endofunctors, play a central role closely related to adjunctions. Monads have been studied mostly in algebraic situations. In this dissertation, we study this concept in some…

Differential Geometry · Mathematics 2014-01-07 Benoît Jubin

It it shown that geometric morphisms between elementary toposes can be represented as adjunctions between the corresponding categories of locales. These adjunctions are characterised as those that preserve the order enrichment, commute with…

Category Theory · Mathematics 2012-07-03 Christopher Townsend

Modeling sequential and parallel composition of effectful computations has been investigated in a variety of languages for a long time. In particular, the popular do-notation provides a lightweight effect embedding for any instance of a…

Programming Languages · Computer Science 2024-07-11 David Richter , Timon Böhler , Pascal Weisenburger , Mira Mezini

The monad of convex sets of probability distributions is a well-known tool for modelling the combination of nondeterministic and probabilistic computational effects. In this work we lift this monad from the category of sets to the category…

Logic in Computer Science · Computer Science 2020-05-18 Matteo Mio , Valeria Vignudelli