> expand into lambda calculus statement that could then be compiled down to different sets of combinators This approach can be reasonably efficient for impleme

> expand into lambda calculus statement that could then be compiled down to different sets of combinators This approach can be reasonably efficient for implementing Haskell, as shown in [1] and the much more concise [2]. [1] https://github.com/augustss/MicroHs https://github.com/augustss/MicroHs [2] https://crypto.stanford.edu/~blynn/compiler/ https://crypto.stanford.edu/~blynn/compiler/