Re: [Haskell-cafe] (names for) invariants for Eq and Ord?

30 May
2018
30 May
'18
3:45 p.m.
Prelude> import qualified Data.Map as M Prelude M> let k = 0/0 in let v = 0 in M.lookup k (M.insert k v M.empty) == Just v False This one is not surprising because the presence of 0/0 destroys the total order of Double, so strictly speaking this should not have an Ord instance. Olaf
2547
Age (days ago)
2547
Last active (days ago)
0 comments
1 participants
participants (1)
-
Olaf Klinke