Talk:Anonymous recursion: Difference between revisions

Content deleted Content added
Gerbrant (talk | contribs)
"anonymous"?: Anonymous!
Line 34:
:For instance, λx(x + 2) is an anonymous function. You can write down stuff like (λx(x + 2))3 and the result is 5.
:However, if you want to define a recursive function, you would have to name it to be able to write down things like f(x) = ...f(x - 1)... This article shows that you can actually define anonymous recursive functions without naming them. Everything clear? [[User:Gerbrant|Shinobu]] 03:51, 2 March 2006 (UTC)
 
== The new function is also recursive!? ==
 
In the second, step, you define a new, recursive function, namely h. Now, instead of defining f by using f itself, you define h by using h itself, and passing around a dummy parameter f (that is not used at all in the function)
 
Should the second step perhaps be: replace f(x-1) by f(x-1,f) ?