Message from JavaScript discussions

May 2019

— Welcome

— 

What, ok, I’m just processing it.
I was wondering that, how do you go from lambda calculus to numbers.

— But you just solved it

— Well, no numbers are involved here

— The 1 and x => x +1 is just an example function

— You can put whatever you like

— main(x)(f) // same as f(x)

— So what do you think?

— I’m trying to reproduce, but, i’m a little lost. How did you do this step?

— So if I build a language on top, I can bootstrap it in any language where I can define X, effectively making it run on many different platforms

Message permanent page

— Https://en.wikipedia.org/wiki/Combinatory_logic#Completeness_of_the_S-K_basis

— I essentially implemented these 6 steps