4 Jul
2013
4 Jul
'13
5:01 a.m.
On Thu, Jul 4, 2013 at 2:20 AM, Patrick Mylund Nielsen < haskell@patrickmylund.com> wrote:
The longer answer is "kind of" -- you can't exactly intuit it, but the profiler is easy to use:
Worth mentioning is that GHC's profiling tools are predicated on a knowledge of graph reduction [1]. [1] To get a leg up on graph reduction, I recommend SPJ and PJ/L's Implementing and Implementation texts: first two links on: http://research.microsoft.com/en-us/um/people/simonpj/Papers/papers.html -- Kim-Ee