Read all the way to the end!

** SPOILER **

> You lean back, exhausted but triumphant.

> Dana is dead.

Thank you for a good laugh.

Awesome explainer of combinator logic, the writing style reminded me of this series of posts (which is always a good thing in my opinion):

https://aphyr.com/posts/353-rewriting-the-technical-intervie...

nice 9.5/10 (minus half a point because my brain got hurt a little)

The last code block scrolls, by the way. It's 166 kB.

Note that S and K are curried functions which take one argument at a time. Further reading: https://stackoverflow.com/a/36321/

sheeeshhh, that's harsh

haha I was not expecting this journey :)

brilliant work!

And after all of this, all that one gets to do is using AI prompts to configure integrations on a MACH architecture cloud product, fetching data from a content cloud into a CMS.

Great article by the way.

nothing compares to Y

    let A = (x) => (y) => (z) => x(z)(y((w) => z))

Just need to combine this a few times.

    let K = A(A(A))(A(A(A))(A)(A)(A)(A)(A); // (x) => (y) => x
    let S = A(A(A(A)(A(A)(A(A)))(A(A(A(A)((A(A)))))))(A)(A); // (x) => (y) => (z) => x(z)(y(z))

> “I would never be caught dead using Lambda calculus. It’s a bloated language.”

Actually, combinatory logic is more bloated than lambda calculus, generally needing more bits to express the same program [1].

> Dana smirks. “Well, yeah. JavaScript is an eager language. Can’t use the Y combinator.”

Eager languages can be made lazy by wrapping arguments in lambdas with dummy arguments, as done in the Javascript BLC interpreter [2].

[1] https://tromp.github.io/cl/LC.pdf

[2] https://github.com/tromp/AIT/blob/master/uni.js#L56