[Haskell-cafe] A Mascot
Bas van Dijk
v.dijk.bas at gmail.com
Wed Nov 16 11:47:49 CET 2011
On 16 November 2011 11:05, MigMit <miguelimo38 at yandex.ru> wrote:
> 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?
Thanks, non-strictness is indeed defined using ⊥ like you mentioned.
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.
More information about the Haskell-Cafe