Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
arethuza
on April 5, 2013
|
parent
|
context
|
favorite
| on:
List out of Lambda
All you need is S and K - all the rest is syntactic sugar, even Y.
:-)
arianvanp
on April 5, 2013
[–]
SKI combinator is indeed another explanation of why the λ-calculus is turing complete :
http://en.wikipedia.org/wiki/SKI_combinator_calculus
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
:-)