Communications of the ACM
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
Reduction languages for reduction machines
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
The architecture and system method of DDM1: A recursively structured Data Driven Machine
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
A concurrent processing system for lisp
A concurrent processing system for lisp
ACM SIGPLAN Notices
Can REDUCE be run in parallel?
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Integrating functional and imperative programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Parallelism in algebraic computation and parallel algorithms for symbolic linear systems
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
A bibliography on multiprocessor Lisp systems and applications
ACM SIGPLAN Lisp Pointers
| Hi-index | 0.00 |
Described is a strategy for the compilation of LISP programs for a concurrent processing system in the presence of global side effects. The method supports “horizontal” concurrency, the concurrency available when two arguments of a function can be evaluated simultaneously and without violating the semantics of sequential LISP. The method works for Standard LISP and is not restricted to “pure” LISP. Conventional programs may usually be compiled without modification.