News for hackers. Stuff that matters.
Re:Applicative Functors by lmm on Sunday August 10, 2014 @04:25AM (#8159195)
The example applicative still respects sequencing - to do what the last paragraph claims to be doing you'd need to use some kind of nondeterministic gather.

Honestly I think the differences in that example are pretty superficial. The real advantage of applicative is that because the assumptions are weaker, some things that aren't Monads are Applicatives.

Re:Applicative Functors by sfvisser on Sunday August 10, 2014 @12:05PM (#8160010)
>Honestly I think the differences in that example are pretty superficial.

For most instances the difference is superficial, but for some problem domains the difference can have a pretty big impact.

All of this is because Applicative composition (using apply) statically guarantees there is no data dependencies between the (possibly) effectful computations. Monadic composition (using bind) can (but might not) introduce a data dependency which can only be reasoned about at runtime.

Facebook's Haxl project is an interesting example of this: http://www.cs.ox.ac.uk/ralf.hinze/WG2.8/31/slides/simon.pdf

Re:Applicative Functors by tel on Sunday August 10, 2014 @11:50AM (#8159983)
Applicatives can be analyzed without outside information. Applicatives are also closed under composition (and thus there's no need for the entire "transformer" concept).

As far as I'm aware, nearly every functor admits at least one applicative structure and oftentimes many choices thereof.

Re:Applicative Functors by eru on Sunday August 10, 2014 @09:07AM (#8159633)
That's also why Applicatives combine better.