Re: Expected behavior of "deriving Ord"?

Conal Elliott wrote:

AddBounds makes total orders from total orders. It just adds new least and greatest elements.

The problem with the derived instance is that it doesn't exploit the potential laziness of min on 'a'. Because of their types, min it can produce partial info from partial info and (<=) and compares cannot.

Right, I've mixed up partial orders, partial (infinite?) values as input to total order functions. I could not construct an example, though. min (NoBound MinBound) (NoBound (NoBound undefined)) worked using ghci. Cheers Christian