Dominic Steinitz wrote:
I haven't formally checked it, but I would bet that this endofunctor
over N, called Sign, is a monad:
Just to be picky a functor isn't a monad. A monad is a triple consisting of a
functor and 2 natural transformations which make certain diagrams commute.
Whi
Thanks for keeping me honest ;)
On 3/15/07, Dominic Steinitz <[EMAIL PROTECTED]> wrote:
> I haven't formally checked it, but I would bet that this endofunctor
> over N, called Sign, is a monad:
Just to be picky a functor isn't a monad. A monad is a triple consisting of a
functor and 2 natural t
> I haven't formally checked it, but I would bet that this endofunctor
> over N, called Sign, is a monad:
Just to be picky a functor isn't a monad. A monad is a triple consisting of a
functor and 2 natural transformations which make certain diagrams commute.
If you are looking for examples, I al
That said, N and R are indeed categories; however, considering them as
categories should be carefully interlaced with your intuitions about
them as types.
I haven't formally checked it, but I would bet that this endofunctor
over N, called Sign, is a monad:
Sign x = x + x
Pos = injectLeft
Neg
On 3/15/07, Steve Downey <[EMAIL PROTECTED]> wrote:
EOk, i'm trying to write down, not another monad tutorial, because I
don't know that much yet, but an explication of my current
understanding of monads.
But before I write down something that is just flat worng, I thought
I'd get a cross check
EOk, i'm trying to write down, not another monad tutorial, because I
don't know that much yet, but an explication of my current
understanding of monads.
But before I write down something that is just flat worng, I thought
I'd get a cross check. (and I can't get to #haskell)
Monads are Functors.
