Recursions without names: Introduction to the Y combinator in JavaScript

Re:Recursions without names: Introduction to the Y combinato... by nightcracker on Thursday August 11, 2016 @07:30PM (#12272451)

If I'm not mistaken, this isn't the full Y combinator yet. It's a partial step towards deriving the full Y combinator.

    (f => (x => x(x))(y => f(x => y(y)(x))))
    (func => n => (n === 0) ? 1 : (n * func(n - 1)))
    (19)

Notice that the ugly func(func)(n-1) recursive call with the proper Y combinator simply became func(n-1).

The full Y combinator is also vastly more mystical and less obvious than the partial step :)

[ Parent | on HN ]

Re:Recursions without names: Introduction to the Y combinato... by viebel on Friday August 12, 2016 @01:59AM (#12273631)

The full Y combinator is presented in the sequel of the current article: http://blog.klipse.tech/lambda/2016/08/10/pure-y-combinator-...

[ Parent | on HN ]

Re:Recursions without names: Introduction to the Y combinato... by thethirdone on Thursday August 11, 2016 @11:11PM (#12273187)

> The full Y combinator is also vastly more mystical and less obvious than the partial step :)

The full Y conbinator simply binds func to func(func) as seen in `(y => f(x => y(y)(x))))`, an easy jump to make and pretty easy to understand.

[ Parent | on HN ]