[Haskell-cafe] Clarification on proof section of HS: The Craft of FP

Daniel Carrera dcarrera at digitaldistribution.com
Mon May 2 09:58:48 EDT 2005


Daniel Fischer wrote:

> Both do, but in Explanation 2, you omitted 'finite' a couple of times.

Well, I also omited the word "countable". I figure it's understood since 
computers only deal with finite data. And given an infinite list, any 
finite "head" of it would meet the criteria, so the distinction is moot. 
Unless Haskell has some neat property I am not aware of :-)

Cheers,
Daniel.


More information about the Haskell-Cafe mailing list