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

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