[Haskell-cafe] ordNub
Tom Ellis
tom-lists-haskell-cafe-2013 at jaguarpaw.co.uk
Thu Jan 1 14:18:15 UTC 2015
On Thu, Jan 01, 2015 at 02:14:16PM +0000, Tom Ellis wrote:
> So let me clarify that I want (<=) to be a total order in the sense that it
> is
>
> * reflexive
> * symmetric
> * transitive
>
> and `(x <= y) && (y <= x)` implies that `x == y`. (*)
Correction: I mean "antisymmetric" not "symmetric". Anti-symmetry is
exactly this condition (*).
Futhermore I want (==) to be at least as fine-grained as extensional
equivalence.
Tom
More information about the Haskell-Cafe
mailing list