The Next Symta

An experimental Lisp-like language:
https://github.com/saniv/symta

Of course that is a prototype, but it shows how initial parentheses-ridden mess (root/boot/*.hit files) bootstraps into a readable language (root/lib/*.hit files).

>>38
It seems clear from your ``Nope'' that you aren't claiming that lambda calculus and SSA representation are the same thing, but that it is trivial to translate between them. I don't care enough to verify that, so that sounds reasonable. For your reference, what confused me was that, when you said ``Java's compiler already does this transformation'', you weren't referring to the full transformation of Java to lambda calculus that I was asking about from your ``efficiently compiling for example Java code is the matter of translating Java to lambda calculus and running the present compiler'' statement.

As to ``wtf is "yin yang puzzle"?'', I'll refer you to these search results for ``yin yang callcc'':

http://everything2.com/title/call%252Fcc+yin-yang+puzzle
http://stackoverflow.com/questions/2694679/how-does-the-yin-yang-puzzle-work