[Haskell-cafe] Ord for partially ordered sets

[Mike Izbicki]

>> 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?
>
>False.

The operators aren't a problem for this reason.  The real problem is
what does `compare` return?

On Fri, Apr 24, 2015 at 1:32 PM, Ertugrul Söylemez <ertesx at gmx.de> wrote:
>> 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?
>
> False.
>
>
> Greets,
> Ertugrul
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
>