diff options
| author | Gaël Deest <gael.deest@tweag.io> | 2021-03-18 09:40:39 +0100 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2021-03-20 07:48:01 -0400 |
| commit | 7d027433d30bdccf787197b28abfdcc1de263b89 (patch) | |
| tree | d5bd8b55a9c8b1add1aa5e026a0253597d61a175 /testsuite | |
| parent | d03d876185da2db9b397c58a383c0eac1892cafc (diff) | |
| download | haskell-7d027433d30bdccf787197b28abfdcc1de263b89.tar.gz | |
[skip ci] Fix 'Ord' documentation inconsistency
Current documentation for the `Ord` typeclass is inconsistent. It
simultaneously mentions that:
> The 'Ord' class is used for totally ordered datatypes.
And:
> The Haskell Report defines no laws for 'Ord'. However, '<=' is
> customarily expected to implement a non-strict partial order […]
The Haskell report (both 98 and 2010 versions) mentions total ordering,
which implicitly does define laws. Moreover, `compare :: Ord a => a -> a
-> Ordering` and `data Ordering = LT | EQ | GT` imply that the order is
indeed total (there is no way to say that two elements are not
comparable). This MR fixes the Haddock comment, and adds a comparability
law to the list of suggested properties.
Diffstat (limited to 'testsuite')
0 files changed, 0 insertions, 0 deletions