Re: foldl, tail recursion, and strictness (was: stack overflow)

I know it's complete heresy to say so, but I use laziness very little in Haskell, while I probably pay quite a lot for it in CPU time and memory, because of all those thunks which have to be stored. However I prefer Haskell's type classes, syntax and purity to, say, Standard ML. So I wonder whether there ought to be a language "Strict Haskell", in the same way as someone implemented "Lazy ML" . . .