not.
So, ⊆ is the /conventional/ order for sets, ⇒ is the conventional order
for predicates, ≤ is the conventional order for numbers, and so on. That
still dictates that False < True is the conventional order for booleans.
Albert Y. C. Lai wrote:
Scott Brickner wrote:
It's actually no
All these smart math guys hanging around and nobody's given a really
decent answer to this?
It's actually not arbitrary. There's a strong connection between
predicates (functions that return boolean values) and sets. Any
predicate uniquely determines a set - the set of values for which it
ret
Jacques Carette wrote:
Lennart Augustsson wrote:
I must second this opinion. There's this (false) perception that you
need all
kinds of extensions to make Haskell usable. It's simply not true.
Certain
extensions can make your life easier, but that's it.
To write code in Haskell, this i
Jacques Carette wrote:
Neil Mitchell wrote:
The biggest
runtime crasher is probably pattern match failings, something that
most of these type extensions don't catch at all!
Array out-of-bounds, fromJust, head on an empty list, and
pattern-match failures are in my list of things I wish the t
Donald Bruce Stewart wrote:
sdowney:
i'm not naive enough to think they are the composition function, and
i've gathered it has something to do with free terms, but beyond that
i'm not sure. unless it also has something to do with fix points?
The wiki knows all! :)
http://haskell.o
