Give alternate default definition for (<=)

[Dannyu NDos]

2020년 5월 9일 (토) 12:35, Carter Schonwald <carter.schonwald at gmail.com>님이 작성:

> That seems undecidable in general.
>

True. It is proven that there is no algorithm that compares arbitrary
computable numbers.

In other words, min and max are algorithms, but (==) and (<=) are not.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/libraries/attachments/20200509/5ac54766/attachment.html>