To show the Turing-completeness of a functional programming language, it's usually easier to implement the S and K combinators [1] than to directly implement a

To show the Turing-completeness of a functional programming language, it's usually easier to implement the S and K combinators [1] than to directly implement a Turing machine. [1] https://en.wikipedia.org/wiki/SKI_combinator_calculus https://en.wikipedia.org/wiki/SKI_combinator_calculus