We introduce a generalization of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typed λ-calculus syntax and indexed containers. We show that the Kleisli and Eilenberg-Moore constructions carry over to relative monads and are related to relative adjunctions. Under reasonable assumptions, relative monads are monoids in the functor category concerned and extend to monads, giving rise to a coreflection between relative monads and monads. Arrows are also an instance of relative monads
AbstractStudied are Kleisli categories of monads of sets which satisfy two properties motivated by f...
There are different notions of computation, the most popular being monads, applicative functors, and...
Algebraic effects and handlers are a convenient method for structuring monadic effects with primitiv...
We introduce a generalization of monads, called relative monads, allowing for underlying functors be...
Relative monads are a generalisation of ordinary monads where the underlying functor need not be an ...
AbstractMonads are by now well-established as programming construct in functional languages. Recentl...
We develop the formal theory of monads, as established by Street, in univalent foundations. This all...
The concept of dyad is defined as the least common generalisation of monads and co-monads. So, taki...
Arrows are an extension of the well-established notion of a monad in functional-programming language...
Relative monads are a generalisation of ordinary monads where the underlying functor need not be an ...
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and ...
AbstractMonads have become very popular for structuring functional programs since Wadler introduced ...
Each datatype constructor comes equiped not only with a so-called map and fold (<i>catamorphism</i>)...
AbstractWe revisit the connection between three notions of computation: Moggiʼs monads, Hughesʼs arr...
There are different notions of computation, the most popular being monads, applicative functors, and...
AbstractStudied are Kleisli categories of monads of sets which satisfy two properties motivated by f...
There are different notions of computation, the most popular being monads, applicative functors, and...
Algebraic effects and handlers are a convenient method for structuring monadic effects with primitiv...
We introduce a generalization of monads, called relative monads, allowing for underlying functors be...
Relative monads are a generalisation of ordinary monads where the underlying functor need not be an ...
AbstractMonads are by now well-established as programming construct in functional languages. Recentl...
We develop the formal theory of monads, as established by Street, in univalent foundations. This all...
The concept of dyad is defined as the least common generalisation of monads and co-monads. So, taki...
Arrows are an extension of the well-established notion of a monad in functional-programming language...
Relative monads are a generalisation of ordinary monads where the underlying functor need not be an ...
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and ...
AbstractMonads have become very popular for structuring functional programs since Wadler introduced ...
Each datatype constructor comes equiped not only with a so-called map and fold (<i>catamorphism</i>)...
AbstractWe revisit the connection between three notions of computation: Moggiʼs monads, Hughesʼs arr...
There are different notions of computation, the most popular being monads, applicative functors, and...
AbstractStudied are Kleisli categories of monads of sets which satisfy two properties motivated by f...
There are different notions of computation, the most popular being monads, applicative functors, and...
Algebraic effects and handlers are a convenient method for structuring monadic effects with primitiv...