A SIMPLE MACHINE
Alexander Dickinson, Michael Timothy Brian Pope · 1992
Functional languages and Turner's SK-combinator reduction mechanism offer the promise of he grained corn putation based on simple rules. We describe asimple machine architecture based on an extension to combinator notation. Code travels along a unidirectional dream and is executed in parallel by simple finite state machine based cells separated by sections of FIFO buffer. The resulting regularity and structural simplicity ensures a good match to VLSI implementation. We have verified that the extended combmator is a viable execution model, and present preliminary simulation results.