Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on JavaScript is Dead. Long Live JavaScript. Parent comment
S-K combinators[1] are a Turing-complete subset of lambda calculus. Here's an implementation of them:
k = (x) -> (y) -> x s = (x) -> (y) -> (z) -> x(z)(y(z))
There are no comments on this comment yet.
S-K combinators[1] are a Turing-complete subset of lambda calculus. Here's an implementation of them:
1: http://en.wikipedia.org/wiki/SKI_combinator_calculus