[Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)
midfield at gmail.com
Sat Apr 21 01:05:08 CEST 2012
i'm not sure what your email is pointing at. if it is unclear, i understand the difference between applicative and monadic. i suppose the easy answer to why applicative can be faster than monadic is that you can give a more specialized instance declaration. i was just wondering if there was a way to make a monad recognize when it is being used applicatively, but that is probably hard in general.
On Apr 20, 2012, at 2:54 PM, KC wrote:
> Think of the differences (and similarities) of Applicative Functors and Monads and the extra context that monads carry around.
More information about the Haskell-Cafe