On 14/06/2010 23:17, Ivan Lazar Miljenovic wrote:
Emmanuel Castro<[email protected]> 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.
--
[email protected]
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
