Future of Coding is an online community with a welcoming, cooperative, and revolutionary spirit. We are unified in the belief that the common practice of programming is tragically less humane than it could be.

Future of Coding

I was curious to see if I could make a data structure using nothing but lambdas, and I came up with these JavaScript snippets:

(H)=&gt;((F)=&gt;F(F)())((S,V,P)=&gt;(X)=&gt;X?S(S,X,S(S,V,P)):(H(V),P||S(S)))

(H)=&gt;((F)=&gt;F(F)())((Q,V,N)=&gt;(X)=&gt;X?Q(Q,V,Q(Q,X,N)):(H(V),N||Q(Q)))

Try this in your browser debugger:

(...either snippet here...)(console.log)(1)(2)(3)()(4)()()(5)()()()()()()(8)()()

And here's my attempt at a Turing machine

It's JavaScript syntax. Which might happen to be close? The c?t:f is the ternary conditional operator, which in a LISP is more like: (IF, c, (t), (f))

this is what I meant by Church encoding <https://en.wikipedia.org/wiki/Church_encoding>

I suppose it's similar in concept, but not quite the same thing. At each step, you can pass parameters, and the result is the new "state", as a function of the previous state and the parameters.

The functions take themselves as an argument, to allow for recursive calls. That's not necessary for recursion on most languages, but only if you use assignment or "declarations". Here I was doing it without either, all as one single inline expression.