So the ideas are: - the only data type is a stack of stacks of stacks of ... - a while loop can be as "loop while the top of the stack is not empty" - pushing the stack at the top of the stack to the stack below it, popping an element from the (main) stack, swapping the two stacks on top - some two-stack operations that move the top element between them (to simulate a tape for TC) - recurse into top stack
All right, I have a page for syntax now. Nothing's concrete yet, so feel free to propose syntax changes, different names for commands, add explanations, etc.