This question:
> What is the basic philosophy for Bool being a member of Ord?
...
> What justifies False < True?

resulted in some answers:
in most interpretations this equals:
False == 0
True == 1
...
Although this is not a must, I would like to remind you also that
in formal math there *IS* a strong relation between the ordering
and binary 'algebraic' relation. The Boolean algebra / Boolean lattice
in a nice structure, and Ord could in principle be derived from
the login connectives. But this is a subsumption, which in Haskell
cannot be done automatically, so we do it explicitly...
See here: http://en.wikipedia.org/wiki/Boolean_algebra Jerzy Karczmarczuk
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe

Reply via email to