On 11/10/06, Nicolas Frisby <[EMAIL PROTECTED]> 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 (...))))
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
