[Haskell-cafe] beginner's problem about lists

[Cale Gibbard]

On 11/10/06, Nicolas Frisby <nicolas.frisby at gmail.com> wrote:
> Intuitively
>
> q = lfp f = f(f(f(f(f(f .... (f(f(f _|_)))...)))))            (*)
> r = lfg g = g(g(g(g(g(g .... (g(g(g _|_)))...)))))     (**)
>

This way of writing it would imply (at least to me) that the number of
f's and g's involved is finite, when that's not really the intention.
It's probably better to write something like:

q = lfp f = f (f (f (f (...))))