On 15/09/06, Haihua Lin <[EMAIL PROTECTED]> wrote:
Is there a way to define it in Haskell?

Note that the function 'fix' (find the fixpoint of a function) already
exists in Haskell, and is equivalent to the Y combinator.

It's interesting that most (all?) fixed-point combinators don't
typecheck. The Y combinator, and by extension recursion in general,
has to be added as a constant to the language.

--
-David House, [EMAIL PROTECTED]
_______________________________________________
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell

Reply via email to