[Haskell-cafe] benchmarking pure code

Edward Z. Yang ezyang at MIT.EDU
Wed Mar 31 03:25:10 EDT 2010

Excerpts from Paul Brauner's message of Wed Mar 31 03:17:02 -0400 2010:
> The part I want to benchmark is 2. In particular I would like that:
>  a. \x.t is already evaluated when I run 2 (I don't want to measure the
>     performances of the generator)
>  b. the action of substituting u for x in t were measured as if I had to
>     fully evaluate the result (by printing the resulting term for
>     instance).

Criterion uses Control.DeepSeq; perhaps this is what you are looking for?


More information about the Haskell-Cafe mailing list