<div dir="ltr"><div class="gmail_extra"><br><div class="gmail_quote">On Thu, Jul 4, 2013 at 2:20 AM, Patrick Mylund Nielsen <span dir="ltr"><<a href="mailto:haskell@patrickmylund.com" target="_blank">haskell@patrickmylund.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex"><div>The longer answer is "kind of" -- you can't exactly intuit it, but the profiler is easy to use:</div>
<div></div></blockquote></div><br>Worth mentioning is that GHC's profiling tools are predicated on a knowledge of graph reduction [1].<br><br>[1] To get a leg up on graph reduction, I recommend SPJ and PJ/L's Implementing and Implementation texts: first two links on:</div>
<div class="gmail_extra"><br></div><div class="gmail_extra"><a href="http://research.microsoft.com/en-us/um/people/simonpj/Papers/papers.html">http://research.microsoft.com/en-us/um/people/simonpj/Papers/papers.html</a><br>
<br><div>-- Kim-Ee</div>
</div></div>