"Jeffrey A. Scofield" <[EMAIL PROTECTED]> writes:
> I'm not worried about speed per se, rather I'm trying to validate
> my (rough) complexity analysis for the function and, if it works,
> to make some projections for how long it would take to calculate
> various things.
Since you aren't interested in absolute timings, just the algorithmic
complexity, then you could try using a less smart compiler (e.g. nhc98)
which will not automatically optimise away the repeated calls.
Regards,
Malcolm
_______________________________________________
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
