[Haskell-cafe] timing question

[Arie Groeneveld]

Suppose I've:

f = map g

I want to know how much time it takes (interpreted mode) to fully 
process list xs (at least 1e6 elements) with function g. Is it 
sufficient to execute:

*Main> last . f $ xs
<result>
(x.xx secs, yyyyyyyyyyy bytes)

Are there any hidden difficulties involved?

Reason is: comparing timings Haskell vs an interpreted language without 
laziness.


thanks

=@@i