Re: [Haskell-cafe] Commutative monads vs Applicative functors

2008-05-18 Thread Henning Thielemann
On Wed, 14 May 2008, David Menendez wrote: On Tue, May 13, 2008 at 9:06 PM, Ronald Guida [EMAIL PROTECTED] wrote: I have a few questions about commutative monads and applicative functors. From what I have read about applicative functors, they are weaker than monads because with a monad, I

Re: [Haskell-cafe] Commutative monads vs Applicative functors

2008-05-14 Thread David Menendez
On Tue, May 13, 2008 at 9:06 PM, Ronald Guida [EMAIL PROTECTED] wrote: I have a few questions about commutative monads and applicative functors. From what I have read about applicative functors, they are weaker than monads because with a monad, I can use the results of a computation to

Re: [Haskell-cafe] Commutative monads vs Applicative functors

2008-05-14 Thread Ronald Guida
David Menendez wrote: To summarize: some applicative functors are commutative, some applicative functors are monads, and the ones that are both are commutative monads. OK, so commutativity is orthogonal to idiom vs monad. Commutativity depends on whether or not the order of side effects is

[Haskell-cafe] Commutative monads vs Applicative functors

2008-05-13 Thread Ronald Guida
I have a few questions about commutative monads and applicative functors. From what I have read about applicative functors, they are weaker than monads because with a monad, I can use the results of a computation to select between alternative future computations and their side effects, whereas