English
Related papers

Related papers: Algebraic theories, monads, and arities

200 papers

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

Commutative Algebra · Mathematics 2025-11-11 Ezra Miller

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

A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…

Logic · Mathematics 2024-06-12 Niels Charlier , Hans Vernaeve

In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…

Logic in Computer Science · Computer Science 2017-10-11 Richard Garner , Tom Hirschowitz

The geometric and algebraic theory of valuations on cones is applied to understand identities involving summing certain rational functions over the set of linear extensions of a poset.

Combinatorics · Mathematics 2012-05-07 Adrien Boussicault , Valentin Feray , Alain Lascoux , Victor Reiner

Recently V.I.Arnold have formulated a geometrical concept of monads and apply it to the study of difference operators on the sets of $\{0,1\}$-valued sequences of length $n$. In the present note we show particular examples of these monads…

Combinatorics · Mathematics 2007-11-12 Oleg Karpenkov

We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…

Logic · Mathematics 2016-09-07 Harvey M. Friedman

These are expanded lecture notes from lectures given at the Workshop on higher structures at MATRIX Melbourne. These notes give an introduction to Feynman categories and their applications. Feynman categories give a universal categorical…

Algebraic Topology · Mathematics 2017-06-02 Ralph M. Kaufmann

Many structured categories of interest are most naturally described as algebras for a relative monad, but turn out nonetheless to be algebras for an ordinary monad. We show that, under suitable hypotheses, the left oplax Kan extension of a…

Category Theory · Mathematics 2025-06-12 Umberto Tarantino , Joshua Wrigley

In these lecture notes, we give a brief introduction to some elements of category theory. The choice of topics is guided by applications to functional programming. Firstly, we study initial algebras, which provide a mathematical…

Programming Languages · Computer Science 2026-03-09 Benedikt Ahrens , Kobe Wullaert

In the study of computational effects, it is important to consider the notion of computational effects with parameters. The need of such a notion arises when, for example, statically estimating the range of effects caused by a program, or…

Category Theory · Mathematics 2019-04-18 Soichiro Fujii

Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e.~classes of finite algebras closed under finite products,…

Category Theory · Mathematics 2021-06-01 Jiri Adamek , Liang-Ting Chen , Stefan Milius , Henning Urbat

This article includes a survey of the historical development and theoretical structure of the pre-modern theory of magnitudes and numbers. In Part 1, work, insights and controversies related to quantity calculus from Euler onward are…

Rings and Algebras · Mathematics 2020-03-03 Dan Jonsson

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…

Category Theory · Mathematics 2019-05-21 Dali Zangurashvili

Codensity monads provide a universal method to generate complex monads from simple functors. Recently, a wide range of important monads in logic, denotational semantics, and probabilistic computation, such as several incarnations of the…

Logic in Computer Science · Computer Science 2026-03-10 Fabian Lenke , Nico Wittrock , Stefan Milius , Henning Urbat

We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our main contributions are presentation results for the monads,…

Logic in Computer Science · Computer Science 2021-04-22 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

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

We develop an $\infty$-categorical version of the classical theory of polynomial and analytic functors, initial algebras, and free monads. Using this machinery, we provide a new model for $\infty$-operads, namely $\infty$-operads as…

Algebraic Topology · Mathematics 2020-10-30 David Gepner , Rune Haugseng , Joachim Kock

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
‹ Prev 1 4 5 6 7 8 10 Next ›