English
Related papers

Related papers: Algebraic Presentation of Semifree Monads

200 papers

In recent years, algebraic studies of the differential calculus and integral calculus in the forms of differential algebra and Rota-Baxter algebra have been merged together to reflect the close relationship between the two calculi through…

Category Theory · Mathematics 2020-07-27 Li Guo , William Keigher , Shilong Zhang

We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…

Logic in Computer Science · Computer Science 2015-07-01 Nathan Bowler , Sergey Goncharov , Paul Blain Levy , Lutz Schröder

Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…

Rings and Algebras · Mathematics 2009-05-08 Mark Kambites

Beck's distributive laws provide sufficient conditions under which two monads can be composed, and monads arising from distributive laws have many desirable theoretical properties. Unfortunately, finding and verifying distributive laws, or…

Category Theory · Mathematics 2018-12-14 Maaike Zwart , Dan Marsden

Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of "evaluating an expression partially": for example, "2+3" can be obtained…

Category Theory · Mathematics 2021-04-20 Tobias Fritz , Paolo Perrone

A well-known challenge in the semantics of programming languages is how to combine non-determinism and probability. At a technical level, the problem arises from the fact that there is a no distributive law between the powerset monad and…

Logic in Computer Science · Computer Science 2021-05-17 Bart Jacobs

In the first part of this article, we give an analysis of the free monad sequence in non-cocomplete categories, with the needed colimits explicitly parametrized. This enables us to state a more finely grained functoriality principle for…

Category Theory · Mathematics 2025-04-11 Christian Sattler

Wilcox has considered a twisted semigroup algebra structure on the partition algebra $\mathbb{C}A_k(n)$, but it appears that there has not previously been any known basis that gives $\mathbb{C}A_k(n)$ the structure of a "non-twisted"…

Combinatorics · Mathematics 2025-07-22 John M. Campbell

Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a…

Rings and Algebras · Mathematics 2025-11-04 Manfred Droste , Zoltán Fülöp

It is known that the construction of the frame of ideals from a distributive lattice induces a monad whose algebras are precisely the frames and frame homomorphisms. Using the Fakir construction of an idempotent approximation of a monad, we…

Category Theory · Mathematics 2024-05-01 Ando Razafindrakoto

We study the existence and left properness of transferred model structures for "monoid-like" objects in monoidal model categories. These include genuine monoids, but also all kinds of operads as for instance symmetric, cyclic, modular,…

Category Theory · Mathematics 2017-02-08 Michael Batanin , Clemens Berger

An important result in real algebraic geometry is the projection theorem: every projection of a semialgebraic set is again semialgebraic. This theorem and some of its conclusions lie at the basis of many other results, for example the…

Functional Analysis · Mathematics 2017-09-26 Tom Drescher , Tim Netzer , Andreas Thom

Containers are used to carve out a class of strictly positive data types in terms of shapes and positions. They can be interpreted via a fully-faithful functor into endofunctors on Set. Monadic containers are those containers whose…

Logic in Computer Science · Computer Science 2025-06-16 Chris Purdy , Stefania Damato

Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our…

Programming Languages · Computer Science 2024-10-31 Jack Liell-Cock , Sam Staton

We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Achim Blumensath

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 present some fundamental results on (possibly nonlinear) algebraic semigroups and monoids. These include a version of Chevalley's structure theorem for irreducible algebraic monoids, and the description of all algebraic semigroup…

Algebraic Geometry · Mathematics 2013-12-23 Michel Brion

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

Number Theory · Mathematics 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important…

Logic in Computer Science · Computer Science 2007-05-23 André Hirschowitz , Marco Maggesi

Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…

Logic in Computer Science · Computer Science 2025-10-31 TItouan Carette , Louis Lemonnier , Vladimir Zamdzhiev