Re: [Haskell-cafe] Terminology

On 14/06/2010 23:17, Ivan Lazar Miljenovic wrote:

Emmanuel Castro writes:

...

In practice, g is an optimised version of f when working on large amount of elements.

It's a list, and map is lazy; not too sure you can get anything more optimised than that for long lists.

It may be possible to share calculations between instances of f, for example. -- flippa@flippac.org