Re: [Haskell-cafe] Ord for partially ordered sets

24 Apr
2015
24 Apr
'15
8:22 p.m.
I'm confused. What is supposed to be the result of `g1 <= g2` when `g1` and `g2` are not comparable according to the partial order?
Surely it would make things less confusing to simply follow existing precedent already in the standard prelude? $ ghci Prelude> let nan=0/0::Double Prelude> nan==nan False Prelude> compare 0 nan GT Prelude> compare nan 0 GT Prelude> compare nan nan GT Prelude> 0<=nan False Prelude> nan<=0 False Prelude> nan<=nan False Prelude> let infty=1/0::Double Prelude> infty <= nan False Prelude> nan <= infty False Perhaps not.
3727
Age (days ago)
3727
Last active (days ago)
0 comments
1 participants
participants (1)
-
Barak A. Pearlmutter