[Haskell-cafe] forever function laziness

Eduardo Sato eduardo.sato at gmail.com
Tue Dec 24 02:46:49 UTC 2013

On Tuesday, December 24, 2013, Clark Gaebel wrote:

> forever :: Monad m => m a -> m b
> forever a = a >> forever a

Thanks for your response. This is actually how I would have implemented it.

What is confusing to me is the recursion on the let construct.

What is not clear to me is when we can "get away" with doing that kind of
thing. I mentioned the "tying the knot article" because it, too, uses
recursion on a let construct.

Eduardo Sato
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20131224/ed2f458a/attachment.html>

More information about the Haskell-Cafe mailing list