[Haskell-cafe] Re: A question about "monad laws"
naur at post11.tele.dk
Thu Feb 14 16:44:42 EST 2008
On a tangent, probably:
On Thursday 14 February 2008 10:24, Roman Leshchinskiy wrote:
> Hmm. Personally, I've never seen an algorithm where comparing for exact
> equality was algorithmically necessary. Sometimes (rarely) it is
> acceptable but necessary? Do you know of one?
Finding the "machine epsilon", perhaps, that is, the smallest (floating point,
surely) number for which 1.0+machine_eps==1.0 would be a candidate?
More information about the Haskell-Cafe