Invisible wrote:
>>> In other words, the Iota calculus means you write whole programs that 
>>> just consist of X's and brackets. That's all! Basically, the shape of 
>>> the parse tree is the program! o_O
> 
>>>   X(X(XX)X(X)X(XXX)X(X)X(X(XX)))X(X(X))))X(X)...
> 
>> I think this is the invention of a sick mind. My brain hurts.
>>
>> Why would someone want to do this? (other than the obvious self-abuse?)
> 
> To prove it can be done.
> 
> It's an interesting theoretical question: "How simple can a programming 
> language be before it stops working?"
> 
> The answer - apparently - is "extremely simple".

Oh, so I was right. Self abuse ;)

I'll grant you, it is an interesting theoretical question ... But how 
exactly do you get a result from the above quoted statement, and what 
would that result look like?

Post a reply to this message