Talk:Anonymous recursion: Difference between revisions

Content deleted Content added
SineBot (talk | contribs)
m Signing comment by 128.176.181.114 - "The new function is also recursive!?: new section"
"anonymous"?: four years of thrash info
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)
:: It's not well defined concept as far as I can tell. See [[Talk:First-class_function#Merge_anonymous_function_here]]. [[User:Pohta ce-am pohtit|Pcap]] [[User_talk:Pohta ce-am pohtit|<small>ping</small>]] 01:19, 21 August 2009 (UTC)
 
== The new function is also recursive!? ==