Coordination languages and their significance

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	Arango, M., Berndt, D.~ Ca:rriero, N., Gelernter, D andGilmore, D. Adventures with network Linda. Supercomput. Rev. I0. 3 (:Oct. 1990) 42-46.
	2	Gul Agha, Actors: a model of concurrent computation in distributed systems, MIT Press, Cambridge, MA, 1986
	3	Brian G. Anderson , Dennis Shasha, Persistant Linda: Linda + Transactions + Query Processing, Research Directions in High-Level Parallel Programming Languages, p.93-109, June 17-19, 1991
	4	Babb, R.G.: Parallel processing with large grain data flow techniques. IEEE Co:mput. 17 (1984)55.61.
	5	Bakken, D.E: and Richard D. Schlic:hting, Tolerating Failures: in the Bag-of'Tasks Programming Paradigm. In Proc. of the 21st lnt~ Syrup. Fault-Tolerant Computing, Montreal, Canada (June 1991), 248-255.
	6	Roberto Bisiani , Alessandro Forin, Multilanguage Parallel Programming of Heterogeneous Machines, IEEE Transactions on Computers, v.37 n.8, p.930-945, August 1988 [doi>10.1109/12.2245]
	7	Roberto Bisiani , François Lecouat , Vincenzo Ambriola, A Tool to Coordinate Tools, IEEE Software, v.5 n.6, p.17-25, November 1988 [doi>10.1109/52.10000]
	8	Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989 [doi>10.1145/63334.63337]
	9	Nicholas Carriero , David Gelernter, How to write parallel programs: a first course, MIT Press, Cambridge, MA, 1990
	10	W. J. Dally , A. A. Chien, Object-oriented concurrent programming in CST, Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, p.434-439, January 19-20, 1988, Pasadena, California, United States [doi>10.1145/62297.62346]
	11	Dongarra, J j., Sorenson, D.C:. and Brewer, P. Tools:and Methodology for Programming Parallel Processors, in Aspects of Computation on Asynchronous Processors,: M. Wright, Ed. (North Holland, 1988) pp. 125- 138.
	12	Michael E. Factor, The process trellis software architecture for parallel, real-time monitors, Yale University, New Haven, CT, 1991
	13	Fertig, S, andGelernter, D, A Soft, ware Architecture for Acquiring Knowledge from Cases. In Proc. of the International Joint Conference on Artificiallnteltigence, Sidney, Australia, Aug. 1991.
	14	Michael Factor , David H. Gelernter , Craig E. Kolb , Perry L. Miller , Dean F. Sittig, Real-Time Data Fusion in the Intensive Care Unit, Computer, v.24 n.11, p.45-54, November 1991 [doi>10.1109/2.116850]
	15	Ian Foster , Stephen Taylor, Strand: new concepts in parallel programming, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	16	Narain Gehani , William D. Roome, The concurrent C programming language, Silicon Press, Summit, NJ, 1989
	17	David Gelernter, Multiple Tuple Spaces in Linda, Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages, p.20-27, June 12-16, 1989
	18	David Gelernter , Suresh Jagannathan, Programming linguistics, MIT Press, Cambridge, MA, 1990
	19	Robert H. Halstead, Jr., MULTILISP: a language for concurrent symbolic computation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.4, p.501-538, Oct. 1985 [doi>10.1145/4472.4478]
	20	Jagannathan, S; OptimizingAnalysis for First-Class Tuple SpaceS, In Languages and: Compilers for Parallel CompUting' H. D, Gelernter, T. Gross, A. Nicolau and D. Padua, Eds. MIT Press/Pitman :Publishing, 19911 (forthcoming).
	21	Jagannathan,S. and Philbin, J. Pre. liminary STi N G:benchmarks. NEC Institute Princeton internal Memo. randum, Dec: 1991.
	22	Kahn, K.M. and Miller, :M:~S. Language Design and OpenSysmms, in The Ecology of :Computation. B. Hubermann, Ed., (North Holland, I988) 291:-3:114.
	23	Kambhatla, S. and Walpole, J. Re, covery with limited replay: Faulttolerant processes in Linda; Oregon Grad. Inst. Dept. CSE TR CS/E 90. 019 (Sept. 1990),
	24	LeMetayer, D., ed. Research Directions in: High,~el ParaUel Languages (Mont Saint,Michel: IRISA,INRIA, June 1991): Springer Verlag (forth. coming).
	25	Malone, TiW. What is coordination theory:? MIT Center for Info, Systems Res. WorkingPaper 182 (Feb. 1988).
	26	G. A. Ringwood, Parlog86 and the dining logicians, Communications of the ACM, v.31 n.1, p.10-25, Jan. 1988 [doi>10.1145/35043.35044]
	27	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.32 n.10, p.1241-1258, Oct. 1989 [doi>10.1145/67933.315999]
	28	Turner, D,A. Recursion Equations as a Programming Language, in Functional Programming and its Applications. J, Darlington, P. Henderson andD,A. Turner, Eds. Cambridge University Press (1982)pp. 1-28:,
	29	Wilson, G. ed., Linda-Like Systems and Their Implementations (Edi:nburgh Parallel Computation Cert. tre, June 19191).