Re: [Haskell-cafe] Terminology

14 Jun 2010


      Philippa Cowderoy  writes:
...
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.
So its optimised for duplicate inputs, as well as for large amounts of
elements?

-- 
Ivan Lazar Miljenovic
Ivan.Miljenovic@gmail.com
IvanMiljenovic.wordpress.com