I like the idea of a mascot. I like the idea of a lamb called Da, as most of Haskell's strength comes from it's closeness to pure lambda calculus.
On 16 November 2011 11:05, MigMit <miguelimo38@yandex.ru> wrote:Thanks, non-strictness is indeed defined using ⊥ like you mentioned.
> Maybe it's just me, but I've thought that being non-strict just means that it's possible for a function to produce some value even if it's argument doesn't; in other words, that it's possible to have "f (_|_) ≠ (_|_)". If there was no such thing as (_|_), what would non-strictness mean?
I think I was confusing non-strict evaluation with coinduction. They
have the same advantages but the latter is less powerful but safer
than the former.
Bas
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe