4 ms·
All you need is S and K - all the rest is syntactic sugar, even Y. :-)
by arethuza 14y ago
All you need is S and K - all the rest is syntactic sugar, even Y.
:-)
- arianvanp 14y agoSKI combinator is indeed another explanation of why the λ-calculus is turing complete : http://en.wikipedia.org/wiki/SKI_combinator_calculus http://en.wikipedia.org/wiki/SKI_combinator_calculus