Abstract
We have described several aspects of languages and systems for “applicative” multiprocessing, including some solved and some unsolved problems. From a theoretical point of view, the combination of distributed processing and applicative languages seems to provided an extremely interesting and varied array of topics for future investigation. There seems to be little doubt that this combination will have a significant impact on future uses of computers, as well as theories relating to these uses.
This material is based upon work supported by the National Science Foundation under Grant MCS-77-09369 A01.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.A. Ashcroft and W.W. Wadge. Lucid, a nonprocedural language with iteration. CACM, 20, 7, 519–526 (July 1977).
R.M. Balzer. Ports — A method for dynamic interprogram communication and job control. AFIPS Proc. 38, 485–489 (Spring 1971).
R.H. Campbell and A.N. Habermann. The specification of process synchronization by path expressions in Gelenbe and Kaiser (eds.) Operating Systems, Springer Lecture Notes in Computer Science, 16, 89–102 (1974).
A. Church. The calculi of lambda-conversion. Princeton University Press (1941).
E.W. Dijkstra, et al. On-the-fly garbage collection: An exercise in cooperation. CACM, 21, 11, 966–975 (Nov. 1978).
J. W. Forrester. World dynamics. Wright-Allen Press (1973).
D.P. Friedman and D.S. Wise. CONS should not evaluate its arguments. in Michaelson and Milner (eds.), Automata, Languages, and Programming, 257–284, Edinburgh University Press (1976).
D.P. Friedman and D.S. Wise. The impact of applicative programming on multiprocessing. IEEE Trans. on Computers, C-27, 4, 289–296 (April 1978).
J.V. Giordano. A transformation for parallel programs with indeterminate operators. UC Irvine Dataflow Architecture Project Note No. 46 (Feb. 1980).
P. Henderson and J.H. Morris, Jr. A lazy evaluator. Proc. Third ACM Conference on Principles of Programming Languages, 95–103 (1976).
C.A.R. Hoare. Proof of correctness of data representations. Acta Informatica, 1, 271–281 (1972).
C.A.R. Hoare. Communicating sequential processes. CACM, 21, 8, 666–677 (Aug. 1978).
J.D. Ichbiah, et al. Rationale for the design of the ADA programming language. Sigplan notices, 14, 6, Part B (June 1979).
B. Jayaraman. Resource control in a demand-driven data-flow model. University of Utah, Dept. of Computer Science, PhD dissertation proposal (May 1980).
G. Kahn. The semantics of a simple language for parallel programming. Proc. IFIP '74, 471–475 (1974).
G. Kahn and D. MacQueen. Coroutines and networks of parallel processes. Proc. IFIP '77, 993–998 (1977).
R.M. Keller. Semantics of parallel program graphs. University of Utah, Dept. of Computer Science, Tech. Rept. UUCS-77-110 (July 1977).
R.M. Keller. Denotational models for parallel programs with indeterminate operators. In E.J. Neuhold (ed.), Formal description of programming concepts, 337–366, North-Holland (1978).
R.M. Keller. An approach to determinacy proofs. University of Utah, Dept. of Computer Science, Tech. Rept. UUCS-78-102 (March 1978).
R.M. Keller. Sentinels: A concept for multiprocess coordination. University of Utah, Dept. of Computer Science, Tech. Rept. UUCS-78-104 (June 1978).
R.M. Keller, G. Lindstrom, and S. Patil. A loosely-coupled applicative multi-processing system. AFIPS Proc. (June 1979).
R.M. Keller, G. Lindstrom, and S. Patil. Data-flow concepts for hardware design. Digest of papers, IEEE Compoon 80, 105–111 (Feb. 1980).
Divide and CONCer: Data structuring aspects of applicative multiprocessing. Manuscript submitted for publication (March 1980).
Semantics and applications of function graphs. Manuscript submitted for publication (March 1980).
R.M. Keller and G. Lindstrom. Hierarchical analysis of a distributed evaluator. Manuscript submitted for publication (March 1980).
R.M. Keller and G. Lindstrom. Programming paradigms in a graph-based Lisp extension. Manuscript submitted for publication (March 1980).
FGL Programmer's guide. Internal memorandum, Dept. of Computer Science, University of Utah (March 1980).
Z. Manna and J. Vuillemin. Fixpoint approach to the theory of computation. CACM, 15, 7, 528–536 (July 1972).
A.K. Nori. A storage reclamation scheme for AMPS. M.S. Thesis, Dept. of Computer Science, University of Utah (Dec. 1979).
M. O'Donnell. Computing in systems described by equations. Lecture Notes in Computer Science, 58 (1977).
C.A. Petri. Communication with automata. Supplement 1 to Tech. Rept. RADC-TR-65-377. Griffiss Air Force Base, New York (1966).
D.M. Ritchie and K. Thompson. The Unix time-sharing system. CACM, 17, 7, 365–381 (July 1975).
W.J. Savitch and M.J. Stimson. Time bounded random access machines with parallel processing. JACM, 26, 1, 103–118 (Jan. 1979).
D. Scott. Data types as lattices. SIAM J. Comp., 5, 3, 522–587 (Sept. 1976).
J. Schwarz. Using annotations to make recursion equations behave. Res. Rept. 43, Dept. of Artificial Intelligence, University of Edinburgh (Sept. 1977).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keller, R.M. (1980). Some theoretical aspects of applicative multiprocessing. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022495
Download citation
DOI: https://doi.org/10.1007/BFb0022495
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive