Email or username:

Password:

Forgot your password?
Top-level
February (she/her)

@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.

en.wikipedia.org/wiki/One-inst

3 comments
Devil Lu Linvega

@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.

Devil Lu Linvega

@fbry Subleq emulation is fun, here's one I wrote in just a few lines in a pure stack machine language: git.sr.ht/~rabbits/uxn/tree/ma

February (she/her)

@neauoire Neat! Mine is in C++. I started converting it over to pure C a while ago and never got around to finishing it.

Go Up