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

— I essentially implemented these 6 steps

— 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

— Which really just means stringifying to call expressions

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