[Haskell-cafe] Newbie question about automatic memoization

[peterv]

Does Haskell support any form of automatic memorization?

For example, does the function

	iterate f x

which expands to

	[x, f(x), f(f(x)), f(f(f(x))), =85

gets slower and slower each iteration, or can it take advantage of the =
fact
that f is referentially transparent and hence can be "memoized / =
cached"?

Thanks,
Peter


No virus found in this outgoing message.
Checked by AVG Free Edition.=20
Version: 7.5.476 / Virus Database: 269.10.25/926 - Release Date: =
29/07/2007
23:14
=20