\begin{thebibliography}{PSSS91}

\bibitem[Abr91]{domain-logic}
Samson Abramsky.
\newblock Domain theory in logical form.
\newblock {\em Annals of Pure and Applied Logic}, 1991.

\bibitem[JL87]{lassez-const}
Joxan Jaffar and Jean-Louis Lassez.
\newblock Constraint logic programming.
\newblock In {\em Proceedings of the SIGACT-SIGPLAN Symposium on Principles of
  Programming Languages}, pages 111--119. ACM, January 1987.

\bibitem[LW84]{larsen}
Kim~G. Larsen and Glynn Winskel.
\newblock Using information systems to solve recursive domain equations
  effectively.
\newblock In G.~Kahn, D.B.MacQueen, and G.Plotkin, editors, {\em Semantics of
  Data Types, International Symposium, Sophia Antipolis}, LNCS 173. Springer
  Verlag, 1984.

\bibitem[PSSS91]{psss}
Prakash Panangaden, Vijay Saraswat, Robert Seely, and Phil Scott.
\newblock What is a constraint system?
\newblock Submitted for publication, 1991.

\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[Sar91]{hocc}
Vijay~A. Saraswat.
\newblock Concurrency in the $\lambda$-calculus: {H}igher-order {C}oncurrent
  {C}onstraint {P}rogramming.
\newblock Submitted for publication, 1991.

\bibitem[Sco82]{scott-info-sys}
Dana~S. Scott.
\newblock Domains for denotational semantics.
\newblock In {\em Proceedings of ICALP}, 1982.

\bibitem[SRP91]{popl91}
Vijay~A. Saraswat, Martin Rinard, and Prakash Panangaden.
\newblock Semantic foundations of concurrent constraint programming.
\newblock In {\em Proceedings of Eighteenth ACM Symposium on Principles of
  Programming Languages, Orlando}, January 1991.

\end{thebibliography}
