Message from JavaScript discussions

May 2019

— 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

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

— I essentially implemented these 6 steps

— For the transform

— Removing all function expressions

— Https://github.com/tadeuzagallo/lc-js

— Grabbed this parser to get AST from lambda calculus strings

— And reduced the AST with the steps

— Then stringify to JS

— Which really just means stringifying to call expressions

— name + '(' + body + ')'