Revision as of 13:25, 25 April 2017 edit 201.124.239.99 (talk) →Needs to be rewritten, or a very good review: new section ← Previous edit		Revision as of 13:26, 25 April 2017 edit undo SineBot (talk \| contribs) Bots 2,564,661 edits m Signing comment by 201.124.239.99 - "→Needs to be rewritten, or a very good review: new section" Next edit →
Line 527: Scheme is based on lambda calculus, it is not lambda calculus. In lambda calculus nor combinator logic, one can't write recursive definitions like fact x = if x=0 then 1 else x*fact (x-1) that is the reason for a fixed point combinator. <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/201.124.239.99\|201.124.239.99]] ([[User talk:201.124.239.99#top\|talk]]) 13:25, 25 April 2017 (UTC)</small> <!--Autosigned by SineBot--> ~~that is the reason for a fixed point combinator.~~

Talk:Fixed-point combinator: Difference between revisions