Revision as of 09:08, 13 January 2014 edit Thepigdog (talk \| contribs) Extended confirmed users 5,174 edits →Existence of fixed-point combinators ← Previous edit		Revision as of 09:14, 13 January 2014 edit undo Thepigdog (talk \| contribs) Extended confirmed users 5,174 edits →Simpler way to do anonymous recursion? Next edit →
Line 315: If this is a valid way to do anonymous recursion, why do we need fixpoint combinators to do this? <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/18.111.28.55\|18.111.28.55]] ([[User talk:18.111.28.55\|talk]]) 17:57, 14 November 2013 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot--> The Y combinator is not the only way to do recursion. Recursion in lambda calculus always involved passing in the function to be called as a parameter. Kind regards [[User:Thepigdog\|Thepigdog]] ([[User talk:Thepigdog\|talk]]) 09:14, 13 January 2014 (UTC) ==Existence of fixed-point combinators==

Talk:Fixed-point combinator: Difference between revisions