Full Lazyness??

[marc]

Consider the following haskell-definition:

s :: a -> Integer
s x = sum [1..70000]

Evaluation of main = print (s 0) (a.out -H20000000 -S -a)
results in the correct value after 1.27 seconds and allocates
5881256 bytes from the heap (0 GCs).

Evaluation of main = print (s 0, s 0) (a.out -H20000000 -S -a)
needs 1.68 seconds and 8121656 bytes (0 GCs).

That's not what I want to call fully lazy.

Am I doing something wrong?

PS: Defining s without a parameter x doesn't cause any trouble.

Marc Rehmsmeier.