Talk:Anonymous recursion: Difference between revisions

Revision as of 22:20, 27 April 2015

Revision as of 22:30, 27 April 2015

Line 69:

== Simpler solution ==

I came up with a simpler lambda calculus solution for recursionfactorial. All I did was take the anonymous recursion version, and replace "lambda a, b" with "lambda a: lambda b:", and "(a, b)" with "(a)(b)".

<source lang=python>