Talk:Y combinator: Difference between revisions
Content added Content deleted
Line 60: | Line 60: | ||
:''"The task is to define the stateless Y combinator and use it to compute factorials and Fibonacci numbers from other stateless functions or lambda expressions."'' |
:''"The task is to define the stateless Y combinator and use it to compute factorials and Fibonacci numbers from other stateless functions or lambda expressions."'' |
||
Unfortunately you haven't defined it, and it seems as if it hasn't been used to compute the two functions. --[[User:Paddy3118|Paddy3118]] 05:54, 5 June 2009 (UTC) |
Unfortunately you haven't defined it, and it seems as if it hasn't been used to compute the two functions. --[[User:Paddy3118|Paddy3118]] 05:54, 5 June 2009 (UTC) |
||
==Perl 6 comment on the need for Y?== |
|||
Can anyone explain the comment: |
|||
:''"Note that Perl 6 doesn't actually need a Y combinator because you can name anonymous functions from the inside"'' |
|||
I cannot make sense of it as the Y combinator seems to be a way of adding recursion to mainly theoretical functional languages that don't allow variables holding state. I doubt if any of the RC languages actually ''need'' Y so it seems superfluous. --[[User:Paddy3118|Paddy3118]] 09:51, 11 September 2010 (UTC) |