[Haskell-cafe] Monad laws
Albert Y. C. Lai
trebla at vex.net
Mon Jun 30 22:43:38 UTC 2014
On 14-06-28 11:38 PM, Rafael Almeida wrote:
> People are indeed going to expect that the < operator is transitive.
> Even though the compiler can do nothing about it. I'm not sure how to
> explain why we need < to be transitive. If you do so, please explain
> that to me as well. I always took it for granted that such law must be
Every sub-quadratic-time comparison-based sorting algorithm assumes that
comparisons are transitive.
More information about the Haskell-Cafe