Editing Talk:Corecursion (section)

== Lazy or non-strict? ==

The article says:

: Even if the result is finite, this example depends on lazy evaluation due to the use of self-referential data structures.

I think non-strict evaluation (not necessarily lazy)  is enough; other non-strict evaluation strategies, such as lenient evaluation, might suffice. See http://www.haskell.org/haskellwiki/Lazy_vs._non-strict . [[Special:Contributions/187.46.235.5|187.46.235.5]] ([[User talk:187.46.235.5|talk]]) 22:40, 8 October 2011 (UTC)

: You're right (although outside of the Haskell community "lazy" is often used synonymously with "non-strict", i.e. without the sharing requirement). —''[[User:Ruud Koot|Ruud]]'' 11:35, 10 October 2011 (UTC)