Re: Re: [Haskell-cafe] beginner's problem about lists

On 11/10/06, Nicolas Frisby 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 (...))))