Content deleted Content added
No edit summary |
|||
Line 134:
: It is true that the only form of recursion in lambda calculus is anonymous recursion (since there are no functions names). But for most people in other languages, they are only familiar with recursion by explicitly using the function name. The very concept of anonymous recursion is surprising to many people. It is therefore informative to tell them that fixed point combinators is the mechanism by which anonymous recursion is done (and specifically "anonymous" recursion, to distinguish it from the recursion that they are familiar with). Fixed point combinators are not just for lambda calculus, but also other languages too. --[[Special:Contributions/76.173.203.32|76.173.203.32]] ([[User talk:76.173.203.32|talk]]) 04:31, 22 August 2009 (UTC)
:: This was mentioned in the lead, with references, and I now added another [http://en.wikipedia.org/w/index.php?title=Fixed_point_combinator&diff=309393913&oldid=309356652 paragraph] that delves on the matter in the "how it works" section. There's also a (short, because it's somewhat off-topic) section describing alternative solutions to the problem of anonymous recursion. [[User:Pohta ce-am pohtit|Pcap]] [[User_talk:Pohta ce-am pohtit|<small>ping</small>]] 08:37, 22 August 2009 (UTC)
== Requested move ==
{{Requested move/dated|Fixed-point combinator}}
[[Fixed point combinator]] → {{no redirect|1=Fixed-point combinator}} –
Per WP:HYPHEN and a good proportion of sources. [[User:Tony1|<span style="text-shadow:#BBBBBB 0.1em 0.1em 0.1em; class=texhtml"><font color="darkgreen">'''Tony'''</font >]] [[User talk:Tony1|<font color="darkgreen">(talk)</font ></span>]] 09:17, 19 October 2011 (UTC)
| |||