[Haskell-cafe] Terminology

Philippa Cowderoy flippa at flippac.org
Mon Jun 14 18:23:28 EDT 2010

On 14/06/2010 23:17, Ivan Lazar Miljenovic wrote:
> Emmanuel Castro<emmanuel.castro at laposte.net>  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 

flippa at flippac.org

More information about the Haskell-Cafe mailing list