Is there a way to count numbers of calls, allocations or constructions to get an estimate of program performance in ghc? I am curious about the performance of the various implementations of blowup in previous discussions. Timing and profile sampling is not convenient.
Simon Marlow's book *Parallel and Concurrent Programming in Haskell*, which is freely available online, demonstrates a variety of Haskell profiling tools and an exceptional book that every Haskell programmer should read anyway imo. On Tue, Jan 12, 2016 at 7:39 PM <pmcilroy@gmail.com> wrote:
Is there a way to count numbers of calls, allocations or constructions to get an estimate of program performance in ghc?
I am curious about the performance of the various implementations of blowup in previous discussions. Timing and profile sampling is not convenient. _______________________________________________ Beginners mailing list Beginners@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
s/and an/and is an On Tue, Jan 12, 2016 at 7:44 PM Rein Henrichs <rein.henrichs@gmail.com> wrote:
Simon Marlow's book *Parallel and Concurrent Programming in Haskell*, which is freely available online, demonstrates a variety of Haskell profiling tools and an exceptional book that every Haskell programmer should read anyway imo.
On Tue, Jan 12, 2016 at 7:39 PM <pmcilroy@gmail.com> wrote:
Is there a way to count numbers of calls, allocations or constructions to get an estimate of program performance in ghc?
I am curious about the performance of the various implementations of blowup in previous discussions. Timing and profile sampling is not convenient. _______________________________________________ Beginners mailing list Beginners@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
participants (2)
-
pmcilroy＠gmail.com -
Rein Henrichs