Add to ORKGWe show how one can reason about free monads using their universal properties rather than any concrete implementation. We introduce a graphical, two-dimensional calculus tailor-made to accommodate these properties.status: publishe
Algebraic effects and handlers are a convenient method for structuring monadic effects with primitiv...
String diagrams provide a convenient graphical framework which may be used for equational reasoning ...
Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalge...
We show how one can reason about free monads using their universal properties rather than any concre...
Each datatype constructor comes equiped not only with a so-called map and fold (<i>catamorphism</i>)...
Monads and their composition via distributive laws have many applications in program semantics and f...
In monadic programming, datatypes are presented as free algebras, generated by data values, and by t...
We introduce a generalization of monads, called relative monads, allowing for underlying functors be...
AbstractWe give an explicit description of the free completion EM(K) of a 2-category K under the Eil...
In the world of programming, there are many kinds of languages from which to choose. These varied la...
Monads and their composition via distributive laws have many applications in program semantics and f...
AbstractWe extend the basic concepts of Street’s formal theory of monads from the setting of 2-categ...
National audienceMonadic programming is a popular way to embed effectful computations in purely func...
AbstractA new and simple method of describing all canonical natural transformations on closed catego...
We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to...
Algebraic effects and handlers are a convenient method for structuring monadic effects with primitiv...
String diagrams provide a convenient graphical framework which may be used for equational reasoning ...
Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalge...
We show how one can reason about free monads using their universal properties rather than any concre...
Each datatype constructor comes equiped not only with a so-called map and fold (<i>catamorphism</i>)...
Monads and their composition via distributive laws have many applications in program semantics and f...
In monadic programming, datatypes are presented as free algebras, generated by data values, and by t...
We introduce a generalization of monads, called relative monads, allowing for underlying functors be...
AbstractWe give an explicit description of the free completion EM(K) of a 2-category K under the Eil...
In the world of programming, there are many kinds of languages from which to choose. These varied la...
Monads and their composition via distributive laws have many applications in program semantics and f...
AbstractWe extend the basic concepts of Street’s formal theory of monads from the setting of 2-categ...
National audienceMonadic programming is a popular way to embed effectful computations in purely func...
AbstractA new and simple method of describing all canonical natural transformations on closed catego...
We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to...
Algebraic effects and handlers are a convenient method for structuring monadic effects with primitiv...
String diagrams provide a convenient graphical framework which may be used for equational reasoning ...
Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalge...