Pilot implementation: Universal FORTH-like language(many other languages / primitives are possible)

• Miniature operating system for multitasking, interwoven with time-optimal backtracking

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

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

• On PC: ~1 million time steps per second

• Yes, I may be 40 years old, but I am still writing code by myself!

“If it isn’t 100 times shorter than C then it isn’t FORTH.” (C. Moore)

Previous slide

Next slide

Back to first slide

View graphic version