A Fortran-Compiled List-Processing Language
Journal of the ACM (JACM)
Design of a LISP-based microprocessor
Communications of the ACM
Analysis of an algorithm for real time garbage collection
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Communications of the ACM
M3L: A list-directed architecture
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
ACM SIGPLAN Notices - Special issue: History of programming languages conference
LISP 1.5 Programmer's Manual
Survey on special purpose computer architectures for AI
ACM SIGART Bulletin
µ3L: An HLL-RISC processor for parallel execution of FP-language programs
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
A high speed list processor for discrete event multiprocessor: simulators
ACM SIGSIM Simulation Digest
Integration of machine organization and control program design: review and direction
IBM Journal of Research and Development
Hi-index | 0.00 |
We have defined a direct-execution model dedicated to non-numerical processing which is based upon an internal representation of source programs derived from LISP. This model provides good support for both sophisticated editing (syntactical parsing, tree manipulation, pretty-printing, ...) of conventional languages and artificial intelligence languages. A high level microprogramming language (LEM) was designed to write the interpreters and the editors. A hardware processor was built and a LISP interpreter, microprogrammed in LEM, has been operational since September 1980. First, the influence of LISP on the LEM language and the architecture is discussed. At the LEM level, we will see that LISP has prompted the control constructs and the access functions to the tree-structured internal form. As for the architecture, we present the hardware implementation of a special garbage collector based upon reference counters. In turn, the machine has influenced the implementation of LISP. We present here the structure of our LISP interpreter and we give evaluation measures dealing with size, development effort, speed; they prove that programming in LEM is easy, short to debug and very concise. Moreover, the speed of our LISP interpreter confirms that the architecture is very efficient for symbolic processing.