Notions of computation as monoids
From MaRDI portal
General theory of categories and functors (18A99) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Monoidal categories, symmetric monoidal categories (18M05) Functional programming and lambda calculus (68N18) Other nonclassical models of computation (68Q09)
Abstract: There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level of abstraction one can obtain useful results which can be instantiated to the different notions of computation. In particular, we show how free constructions and Cayley representations for monoids translate into useful constructions for monads, applicative functors, and arrows. Moreover, the uniform presentation of all three notions helps in the analysis of the relation between them.
Recommendations
Cites work
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- Applicative programming with effects
- Arrows for secure information flow
- Asymptotic Improvement of Computations over Free Monads
- Categorical semantics for arrows
- Categorifying computations into components via arrows as profunctors
- Constructing Applicative Functors
- Doubles for monoidal categories
- Factorising folds for faster functions
- Fast and loose reasoning is morally correct
- Free applicative functors
- Free monoids
- Functorial polymorphism
- Generalising monads to arrows
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- scientific article; zbMATH DE number 742723 (Why is no real title available?)
- scientific article; zbMATH DE number 1956503 (Why is no real title available?)
- scientific article; zbMATH DE number 3339464 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 7324348 (Why is no real title available?)
- Idioms are oblivious, arrows are meticulous, monads are promiscuous
- Limits of small functors
- Modular Monad Transformers
- Monad transformers as monoid transformers
- Monads need not be endofunctors
- Note on monoidal localisation
- Note on the construction of free monoids
- Notions of computation and monads
- On closed categories of functors
- Programs for cheap!
- Structuring quantum effects: superoperators as arrows
- What is a categorical model of arrows?
Cited in
(30)- Equational theories and monads from polynomial Cayley representations
- A divertimento on MonadPlus and nondeterminism
- Arrows, like monads, are monoids
- Comonadic notions of computation
- Fusion for free. Efficient algebraic effect handlers
- Cartesian monoids
- Relating idioms, arrows and monads from monoidal adjunctions
- Monads need not be endofunctors
- Monadic combination using co limits and folds
- scientific article; zbMATH DE number 3924120 (Why is no real title available?)
- Monoidal computer. I: Basic computability by string diagrams
- Implementing collection classes with monads
- Premonoidal categories and notions of computation
- scientific article; zbMATH DE number 2087441 (Why is no real title available?)
- Causal commutative arrows
- Notions of monad strength
- Free applicative functors
- Eilenberg-Moore monoids and backtracking monad transformers
- Compositional game theory, compositionally
- Problems in rewriting applied to categorical concepts by the example of a computational comonad
- A well-known representation of monoids and its application to the function ‘vector reverse’
- Idioms are oblivious, arrows are meticulous, monads are promiscuous
- Monads need not be endofunctors
- A new notation for arrows
- Imaginary groups: lazy monoids and reversible computation
- Categorical Views on Computations on Trees (Extended Abstract)
- On structuring functional programs with monoidal profunctors
- Breadth-first traversal via staging
- The nerve theorem for relative monads
- On graded monads, distributive laws and costrong functors
This page was built for publication: Notions of computation as monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625158)
