[<<][sm][>>][..]
Fri Jan 24 09:28:49 EST 2020

Programmable datapath

Assuming:
- code sequence is an abstract stream (RAM or other SM)
- stack can be unfolded to registers
- primitives can be expanded

Forth really is a good way to turn program transformation into a
simple algebra.  And when the search space isn't too large, discrete
solvers can be used to perform mapping.

I know there is something here, but how to uncover it?




[Reply][About]
[<<][sm][>>][..]