Article

Free access

Compilation techniques for a control-flow concurrent LISP system

Author:

Jed B. MartiAuthors Info & Claims

LFP '80: Proceedings of the 1980 ACM conference on LISP and functional programming

Pages 203 - 207

https://doi.org/10.1145/800087.802807

Published: 25 August 1980 Publication History

PDF eReader

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

[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.

Google Scholar

[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.

Google Scholar

[3]

Backus, J., 'Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs' CACM, Vol. 21, No. 8, (August 1978), pp. 613-641.

Digital Library

Google Scholar

[4]

Berkling, K. J., 'Reduction Languages for Reduction Machines', 2nd Annual Meeting on Computer Architecture (1975), pp. 133-138.

Digital Library

Google Scholar

[5]

Davis, A. L., 'The Architecture and System Method of DDM1: A Recursively Structured Data Driven Machine', Proceedings of the 5th Annual Symposium on Computer Architecture, 1978.

Digital Library

Google Scholar

[6]

Dennis, J. B., D. B. Misunas, 'A Preliminary Architecture for a Basic Data Flow Processor', Proceedings of the 2nd Annual Symposium on Computer Architecture, December (1974), pp. 126-132.

Digital Library

Google Scholar

[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.

Google Scholar

[8]

Hearn, A. C., 'REDUCE 2 Symbolic Mode Primer', Utah Symbolic Computation Group, Operating Note 5 (1973).

Google Scholar

[9]

Marti, J.B., A.C. Hearn, M. L. Griss, C. Griss, 'The Standard LISP Report', SIGPLAN Notices, Vol. 14, No. 10, October (1979), pp. 48-68.

Digital Library

Google Scholar

[10]

Marti, J.B., 'A Concurrent Processing System for LISP', Ph. D. Dissertation, University of Utah, 1980.

Digital Library

Google Scholar

[11]

Weihl, Willaim E., 'Interprocedural Data Flow Analysis in the Presence of Pointers, Procedure Variables, and Label Values', Proceedings of 7th Annual Symposium on Principles of Programming Languages (1980), pp. 83-94.

Digital Library

Google Scholar

Cited By

View all

Marti JFitch J(2005)The Bath Concurrent LISP machineComputer Algebra10.1007/3-540-12868-9_93(78-90)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-12868-9_93
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Fitch J(1989)Can REDUCE be run in parallel?Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation10.1145/74540.74560(155-162)Online publication date: 17-Jul-1989
https://dl.acm.org/doi/10.1145/74540.74560
Show More Cited By

Index Terms

Compilation techniques for a control-flow concurrent LISP system
1. Computer systems organization
  1. Architectures
    1. Other architectures
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

Meta-compilation of language abstractions
Concurrent LISP on a multi-micro-processor system
IJCAI'81: Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2

For solving search problems in AI field, multi-process description is more elegant than the backtracking/coroutine description, from the standpoint of flexible search, high modularity and simple program structure. We propose the language specification ...
Standard LISP (reprint)

When it was first formulated in 1960, (1) the programming language LISP was a truly machine independent language. However, even the earliest computer implementation encountered problems in input-output control and the handling of free variables which ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

LFP '80: Proceedings of the 1980 ACM conference on LISP and functional programming

August 1980

247 pages

ISBN:9781450373968

DOI:10.1145/800087

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 1980

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 30 of 109 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
273
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)4

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Marti JFitch J(2005)The Bath Concurrent LISP machineComputer Algebra10.1007/3-540-12868-9_93(78-90)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-12868-9_93
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Fitch J(1989)Can REDUCE be run in parallel?Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation10.1145/74540.74560(155-162)Online publication date: 17-Jul-1989
https://dl.acm.org/doi/10.1145/74540.74560
Van Deusen M(1988)A bibliography on multiprocessor Lisp systems and applicationsACM SIGPLAN Lisp Pointers10.1145/1317224.13172301:6(51-57)Online publication date: 1-Apr-1988
https://dl.acm.org/doi/10.1145/1317224.1317230
Gifford DLucassen JScherlis WWilliams JGabriel R(1986)Integrating functional and imperative programmingProceedings of the 1986 ACM conference on LISP and functional programming10.1145/319838.319848(28-38)Online publication date: 8-Aug-1986
https://dl.acm.org/doi/10.1145/319838.319848
Sasaki TKanada YJenks RCaviness BNorman A(1981)Parallelism in algebraic computation and parallel algorithms for symbolic linear systemsProceedings of the fourth ACM symposium on Symbolic and algebraic computation10.1145/800206.806388(160-167)Online publication date: 5-Aug-1981
https://dl.acm.org/doi/10.1145/800206.806388

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Meta-compilation of language abstractions

Concurrent LISP on a multi-micro-processor system

Standard LISP (reprint)