This paper presents a machine designed for compact representation and rapid execution of LISP programs, The machine language is a factor of 2 to 5 more compact than S-expressions or conventional compiled code, and the compiler is extremely simple. The encoding scheme is potentially applicable to data as well as program. The machine also provides for user-defined data structures.
5
Recursive functions of symbolic expressions and their computation by machine, Part I
John McCarthy · Communications of the ACM · 1960
1.4K citations
A model and stack implementation of multiple environments
Daniel G. Bobrow, Ben Wegbreit · Communications of the ACM · 1973
159 citations
Burroughs' B6500/B7500 stack mechanism
Eicke Hauck, Bill Dent · 1968
EngineeringSystem ProgrammingB6500/b7500 System Structure+20
88 citations
57 citations
A firmware APL time-sharing system
Rodnay Zaks, David Steingart, Jeffrey A. Moore · 1971
19 citations