Notions of computation as monoids
From MaRDI portal
Publication:4625158
DOI10.1017/S0956796817000132zbMath1476.68098arXiv1406.4823OpenAlexW2963187563MaRDI QIDQ4625158
Mauro Jaskelioff, Exequiel Rivas
Publication date: 20 February 2019
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.4823
Functional programming and lambda calculus (68N18) General theory of categories and functors (18A99) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Other nonclassical models of computation (68Q09) Monoidal categories, symmetric monoidal categories (18M05)
Related Items (6)
Fusion for Free ⋮ Compositional Game Theory, Compositionally ⋮ Breadth-first traversal via staging ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monad transformers as monoid transformers
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- Functorial polymorphism
- Notions of computation and monads
- Limits of small functors
- Arrows for secure information flow
- Free monoids
- Generalising monads to arrows
- Note on the construction of free monoids
- Constructing Applicative Functors
- Categorifying Computations into Components via Arrows as Profunctors
- Factorising folds for faster functions
- Doubles for monoidal categories
- Asymptotic Improvement of Computations over Free Monads
- Monads Need Not Be Endofunctors
- Modular Monad Transformers
- Categorical semantics for arrows
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- Programs for Cheap!
- Free Applicative Functors
- What is a Categorical Model of Arrows?
- Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous
- Fast and loose reasoning is morally correct
- Applicative programming with effects
- Structuring quantum effects: superoperators as arrows
- On closed categories of functors
- Note on monoidal localisation
This page was built for publication: Notions of computation as monoids
