4 ms·
> pure lambdas Also, in lambda calcalus there is no recursion built-in. You have to build it yourself with the Y combinator.
by ackfoobar 4y ago
> pure lambdas
Also, in lambda calcalus there is no recursion built-in. You have to build it yourself with the Y combinator.
- tromp 4y agoRight; you just add definitions you need like let Y = \f. (\x. x x) (\x. f (x x)) in program-using-Y which is the slightly more legible version of (\Y. program-using-Y) (\f. (\x. x x) (\x. f (x x))