Arrows are an extension of the well-established notion of a monad in functional-programming languages. This paper presents several examples and constructions and develops denotational semantics of arrows as monoids in categories of bifunctors Cop × C ¿ C. Observing similarities to monads – which are monoids in categories of endofunctors C ¿ C – it then considers Eilenberg–Moore and Kleisli constructions for arrows. The latter yields Freyd categories, mathematically formulating the folklore claim ‘Arrows are Freyd categories.
AbstractThe notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by s...
AbstractIn this extended abstract we provide a very brief overview of the notion of a monad along wi...
A Frobenius monad on a category is a monad-comonad pair whose multiplication and comultiplication ar...
Arrows are an extension of the well-established notion of a monad in functional-programming language...
AbstractMonads are by now well-established as programming construct in functional languages. Recentl...
We investigate what the correct categorical formulation of Hughes’ Arrows should be. It has long bee...
AbstractWe investigate what the correct categorical formulation of Hughesʼ Arrows should be. It has ...
AbstractMonads have become very popular for structuring functional programs since Wadler introduced ...
There are different notions of computation, the most popular being monads, applicative functors, and...
There are different notions of computation, the most popular being monads, applicative functors, and...
We introduce a generalization of monads, called relative monads, allowing for underlying functors be...
AbstractWe revisit the connection between three notions of computation: Moggiʼs monads, Hughesʼs arr...
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and ...
We present a detailed examination of applications of category theory to functional programming lang...
The concept of dyad is defined as the least common generalisation of monads and co-monads. So, taki...
AbstractThe notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by s...
AbstractIn this extended abstract we provide a very brief overview of the notion of a monad along wi...
A Frobenius monad on a category is a monad-comonad pair whose multiplication and comultiplication ar...
Arrows are an extension of the well-established notion of a monad in functional-programming language...
AbstractMonads are by now well-established as programming construct in functional languages. Recentl...
We investigate what the correct categorical formulation of Hughes’ Arrows should be. It has long bee...
AbstractWe investigate what the correct categorical formulation of Hughesʼ Arrows should be. It has ...
AbstractMonads have become very popular for structuring functional programs since Wadler introduced ...
There are different notions of computation, the most popular being monads, applicative functors, and...
There are different notions of computation, the most popular being monads, applicative functors, and...
We introduce a generalization of monads, called relative monads, allowing for underlying functors be...
AbstractWe revisit the connection between three notions of computation: Moggiʼs monads, Hughesʼs arr...
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and ...
We present a detailed examination of applications of category theory to functional programming lang...
The concept of dyad is defined as the least common generalisation of monads and co-monads. So, taki...
AbstractThe notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by s...
AbstractIn this extended abstract we provide a very brief overview of the notion of a monad along wi...
A Frobenius monad on a category is a monad-comonad pair whose multiplication and comultiplication ar...