English
Related papers

Related papers: Semialgebras and Weak Distributive Laws

200 papers

Monads and their composition via distributive laws have many applications in program semantics and functional programming. For many interesting monads, distributive laws fail to exist, and this has motivated investigations into weaker…

Logic in Computer Science · Computer Science 2022-05-12 Aloïs Rosset , Helle Hvid Hansen , Jörg Endrullis

We study the canonical weak distributive law $\delta$ of the powerset monad over the semimodule monad for a certain class of semirings containing, in particular, positive semifields. For this subclass we characterise $\delta$ as a convex…

Logic in Computer Science · Computer Science 2023-06-22 Filippo Bonchi , Alessio Santamaria

We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…

Category Theory · Mathematics 2012-01-27 Gabriella Böhm

A weak mixed distributive law (also called weak entwining structure) in a 2-category consists of a monad and a comonad, together with a 2-cell relating them in a way which generalizes a mixed distributive law due to Beck. We show that a…

Category Theory · Mathematics 2012-01-27 Gabriella Böhm , Stephen Lack , Ross Street

We describe the canonical weak distributive law $\delta \colon \mathcal S \mathcal P \to \mathcal P \mathcal S$ of the powerset monad $\mathcal P$ over the $S$-left-semimodule monad $\mathcal S$, for a class of semirings $S$. We show that…

Computation and Language · Computer Science 2021-03-30 Filippo Bonchi , Alessio Santamaria

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural…

Logic in Computer Science · Computer Science 2017-01-11 Marcello M. Bonsangue , Helle Hvid Hansen , Alexander Kurz , Jurriaan Rot

We study the (so-called bilinear) factorization problem answered by a weak wreath product (of monads and, more specifically, of algebras over a commutative ring) in the works by Street and by Caenepeel and De Groot. A bilinear factorization…

Rings and Algebras · Mathematics 2013-07-18 Gabriella Böhm , José Gómez-Torrecillas

Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminism in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the…

Logic in Computer Science · Computer Science 2025-07-18 Quentin Aristote

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

Logic in Computer Science · Computer Science 2023-12-29 Cristina Matache , Sean Moss , Sam Staton , Ariadne Si Suo

Fix a monoidal category C. The 2-category of monads in the 2-category of C-actegories, colax C-equivarant functors, and C-equivariant natural transformations of colax functors, may be recast in terms of pairs consisting of a usual monad and…

Category Theory · Mathematics 2007-07-12 Zoran Škoda

A weak entwining structure in a 2-category K consists of a monad t and a comonad c, together with a 2-cell relating both structures in a way that generalizes a mixed distributive law.A weak entwining structure can be characterized as a…

Category Theory · Mathematics 2010-09-21 Gabriella Böhm

Given two monads $S$, $T$ on a category where idempotents split, and a weak distributive law between them, one can build a combined monad $U$. Making explicit what this monad $U$ is requires some effort. When we already have an idea what…

Logic in Computer Science · Computer Science 2025-11-04 Jean Goubault-Larrecq

The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, respectively of the powerset monad over the finite distribution…

Logic in Computer Science · Computer Science 2020-10-05 Alexandre Goy , Daniela Petrisan

We present a categorical theory of monads and distributive laws in substructural contexts. In the study of distributive laws, the roles of (the absence of) structural rules for variable contexts have been recognized; our theory formalizes…

Logic in Computer Science · Computer Science 2026-05-14 Soichiro Fujii , Yun Chen Tsai , Yoàv Montacute , Ichiro Hasuo

We construct the algebra of fractions of a Weak Bialgebra relative to a suitable denominator set of group-like elements that is `almost central', a condition we introduce in the present article which is sufficient in order to guarantee…

Quantum Algebra · Mathematics 2013-08-09 Steve Bennoun , Hendryk Pfeiffer

A categorical model of the multiplicative and exponential fragments of intuitionistic linear logic ($\mathsf{MELL}$), known as a \emph{linear category}, is a symmetric monoidal closed category with a monoidal coalgebra modality (also known…

Logic in Computer Science · Computer Science 2023-06-22 Jean-Simon Pacaud Lemay

Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…

Logic in Computer Science · Computer Science 2025-07-16 Ana Sokolova , Harald Woracek

We develop the basic constructions of homological algebra in the (appropriately defined) unbounded derived categories of modules over algebras over coalgebras over noncommutative rings (which we call semialgebras over corings). We define…

Category Theory · Mathematics 2014-05-12 Leonid Positselski

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

Logic · Mathematics 2018-10-22 Sergio A. Celani , Ma. Paula Menchón

We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…

Logic · Mathematics 2012-10-16 Sergey V. Sudoplatov
‹ Prev 1 2 3 10 Next ›