A recursively microcodable tagged architecture
David M. Harland · ACM SIGARCH Computer Architecture News · 1986
Highly interactive polymorphic programming environments which rely heavily upon higher-order data-driven primitives, dynamic type and range checking, and efficient symbolic lookup would greatly benefit from a ultra high level instruction sets.Facilities for microcoding higher-order, data-driven nested and even recursive algorithms are advocated. It is argued that a tagged storage system provides a natural basis for such an architecture.