@neauoire I've been thinking about how stack machines could be used to implement an efficient programming language on top of one-instruction set machines like SUBLEQ.
This might be another way to approach it, though I need to get my SUBLEQ emulator running again.
@fbry Yeah stacks in subleq is a bit less jumping around than say a register machine, but it's pretty slow. Lambda Calculus style graph reduction is more fun for simple systems to handle stacks, especially if operators are linear. What I linked up top is a queue machine, which is pretty interesting, implementing one in subleq is trickier tho, two pointers at once in a ring-buffer.