Sorry, I thought you or someone was asking why are Applicative Functors faster in general than Monads.<div><br></div><div>Functional programming is structured function calling to achieve a result where the functions can be evaluated in an unspecified order; I thought Applicative Functors had the same unspecified evaluation order; whereas, Monads could carry some sequencing of computations which has the extra overhead of continuation passing.</div>
<div><br></div><div>Do I have that correct?</div><div><br><br><div class="gmail_quote">On Fri, Apr 20, 2012 at 4:05 PM, Ben <span dir="ltr">&lt;<a href="mailto:midfield@gmail.com">midfield@gmail.com</a>&gt;</span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">i&#39;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.<br>

<span class="HOEnZb"><font color="#888888"><br>
b<br>
</font></span><div class="HOEnZb"><div class="h5"><br>
On Apr 20, 2012, at 2:54 PM, KC wrote:<br>
<br>
&gt; Think of the differences (and similarities) of Applicative Functors and Monads and the extra context that monads carry around.<br>
&gt;<br>
&gt;<br>
&gt; --<br>
&gt; --<br>
&gt; Regards,<br>
&gt; KC<br>
<br>
</div></div></blockquote></div><br><br clear="all"><div><br></div>-- <br>--<br>Regards,<br>KC<br>
</div>