\begin{thebibliography}{SWKS88}

\bibitem[AHU74]{AHU}
Al~Aho, John Hopcroft, and J.D. Ullman.
\newblock {\em The design and analysis of computer algorithms}.
\newblock Addison-Wesley, 1974.

\bibitem[BA82]{ben-ari}
M.~Ben-Ari.
\newblock {\em Principles of concurrent programming}.
\newblock Prentice Hall International, 1982.

\bibitem[Dij76]{Dijkstra}
E.~W. Dijkstra.
\newblock {\em A Discipline of Programming}.
\newblock Prentice-Hall, 1976.

\bibitem[FT89]{strand-book}
Ian Foster and Steve Taylor.
\newblock {\em Strand: New concepts in parallel programming}.
\newblock Prentice Hall, 1989.

\bibitem[Gre87]{parlog-book}
S.~Gregory.
\newblock {\em Parallel Logic Programming in \parlog}.
\newblock International Series in Logic Programming. Addison-Wesley, 1987.

\bibitem[HS86]{hillis-data}
W.~Daniel Hillis and Guy~L. Steele.
\newblock Data parallel algorithms.
\newblock {\em CACM}, 29(12):1170--1183, December 1986.

\bibitem[Kah74]{kahn}
G.~Kahn.
\newblock The semantics of a simple language for parallel programming.
\newblock In J.L. Rosenfeld, editor, {\em Proceeedings of IFIP Congress 74},
  pages 471--475., August 1974.

\bibitem[Kah89]{kahn-ecoop}
Kenneth Kahn.
\newblock Objects -- a fresh look.
\newblock In {\em Proceedings of the European Conference on Object-Oriented
  Programming}, pages 207 --224. Cambridge University Press, July 1989.

\bibitem[KRM85]{kruskal-par-prefix}
C.~Kruskal, L.~Rudolph, and Snir M.
\newblock The power of parallel prefix.
\newblock In {\em Proceedings of the 1985 Int. Conf. in parallel processing}.
  IEEE, August 1985.

\bibitem[Kun79]{systol}
H.T. Kung.
\newblock Let's design algorithms for vlsi systems.
\newblock Technical Report 151, CMU-CS, Jan 1979.

\bibitem[Sar89]{my-thesis-book}
Vijay~A. Saraswat.
\newblock {\em Concurrent Constraint Programming Languages}.
\newblock PhD thesis, Carnegie-Mellon University, January 1989.
\newblock To appear, Doctoral Dissertation Award and Logic Programming Series,
  MIT Press, 1990.

\bibitem[Sha83]{CP}
Ehud Shapiro.
\newblock A subset of {Concurrent} {Prolog} and its interpreter.
\newblock Technical Report CS83-06, Weizmann Institute, 1983.

\bibitem[SKL90]{janus}
Vijay~A. Saraswat, Ken Kahn, and Jacob Levy.
\newblock \janus: A step towards distributed constraint programming.
\newblock In {\em Proceedings of the North American Conference on Logic
  Programming}, October 1990.

\bibitem[SR90]{popl90}
Vijay~A. Saraswat and Martin Rinard.
\newblock Concurrent constraint programming.
\newblock In {\em Proceedings of Seventeenth ACM Symposium on Principles of
  Programming Languages, San Fransisco}, January 1990.

\bibitem[ST85]{splay}
D.D. Sleator and R.E. Tarjan.
\newblock Self-adjusting binary search trees.
\newblock {\em JACM}, 32(3):652---686, July 1985.

\bibitem[SWKS88]{dist-term}
Vijay~A. Saraswat, David Weinbaum, Ken Kahn, and Ehud Shapiro.
\newblock Detecting stable properties of networks in concurrent logic
  programming languages.
\newblock In {\em Proceedings of the Seventh Annual ACM Symposium on Principles
  of Distributed Computing (PODC 88)}, pages 210--222, August 1988.

\bibitem[Tar86]{tarjan-turing}
R.E. Tarjan.
\newblock {\em CACM}, March 1986.
\newblock Turing award lecture.

\bibitem[Ued86]{ueda}
K.~Ueda.
\newblock {\em Guarded Horn Clauses}.
\newblock PhD thesis, University of Tokyo, 1986.

\end{thebibliography}
