| Compilation techniques for a control-flow concurrent LISP system |
| Full text |
Pdf
(473 KB)
|
| Source
|
Conference on LISP and Functional Programming
archive
Proceedings of the 1980 ACM conference on LISP and functional programming
table of contents
Stanford University, California, United States
Pages: 203 - 207
Year of Publication: 1980
|
|
Author
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 15, Citation Count: 4
|
|
|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Arvind, Kim P. Gostelow, Wil Plouffe, 'The (Preliminary) ID Report: An Asynchronous Language and Computing Machine', Technical Report #114, Department of Information and Computer Science, University of California Irvine, 1978.
|
| |
2
|
Ashcroft, E. A., W. W. Wadge, 'LUCID - A Formal System for Writing and Proving Programs' SIAM Journal of Computing, No. 3, (September 1976), pp. 336-354.
|
 |
3
|
|
 |
4
|
|
 |
5
|
|
 |
6
|
|
| |
7
|
Keller, R. M., G. Lindstrom, S. Patil, 'A Loosely Coupled Applicative Multi-processor System', Proceedings of the National Computer Conference (1979), pp. 613-622.
|
| |
8
|
Hearn, A. C., 'REDUCE 2 Symbolic Mode Primer', Utah Symbolic Computation Group, Operating Note 5 (1973).
|
 |
9
|
|
| |
10
|
|
 |
11
|
|
|