Interaction laws of monads and comonads

DOI10.1145/3373718.3394808MaRDI QIDQ5145667zbMATH OpenOpenAlexFDO

Authors Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.13477

zbMATH Keywords

monadscomonadsChu spacesinteraction lawsdual of functoreffectful computationHasegawa glueingSweedler dual of monad

Mathematics Subject Classification ID

Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Functional programming and lambda calculus (68N18)

Abstract: We introduce and study functor-functor and monad-comonad interaction laws as mathematical objects to describe interaction of effectful computations with behaviors of effect-performing machines. Monad-comonad interaction laws are monoid objects of the monoidal category of functor-functor interaction laws. We show that, for suitable generalizations of the concepts of dual and Sweedler dual, the greatest functor resp. monad interacting with a given functor or comonad is its dual while the greatest comonad interacting with a given monad is its Sweedler dual. We relate monad-comonad interaction laws to stateful runners. We show that functor-functor interaction laws are Chu spaces over the category of endofunctors taken with the Day convolution monoidal structure. Hasegawa's glueing endows the category of these Chu spaces with a monoidal structure whose monoid objects are monad-comonad interaction laws.

Recommendations

• Algebraic and coalgebraic perspectives on interaction laws
• Stateful runners of effectful computations
• Combining a monad and a comonad
• Monads for behaviour
• Monad compositions. I: General constructions and recursive distributive laws

Cited in

(10)

• scientific article; zbMATH DE number 5026472 (Why is no real title available?)
• Protocol choice and iteration for the free cornering
• Sweedler theory of monads
• Runners for interleaving algebraic effects
• Algebraic and coalgebraic perspectives on interaction laws
• Stateful runners of effectful computations
• Stream processors and comodels
• The costructure–cosemantics adjunction for comodels for computational effects
• Runners in Action
• Algebraic presentation of semifree monads

This page was built for publication: Interaction laws of monads and comonads

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145667)