Implementation: FORTH-like language(many other languages / primitives are possible)

• 61 primitive instructions operating on stack-like data structures. For example: c1(), not(x), inc(x), add(x,y), div(x,y), or(x,y), exch_stack(m,n), push_prog(n), movstring(a,b,n), del(a,n), find(x), defun(m,n), callfun(fn), jmpif(val,address), quote(), unquote(), boostq(n) ….

• Programs are integer sequences; data and code look the same; makes functional programming easy

• On PC: ~1 million time steps per second

Previous slide

Next slide

Back to first slide

View graphic version