\newcommand{\etalchar}[1]{$^{#1}$}
\begin{thebibliography}{BvEG{\etalchar{+}}87}

\bibitem[Abr88]{Abr88}
S.~Abramsky.
\newblock {\em The Lazy Lambda Calculus}, pages 65--116.
\newblock Addison Wesley, 1988.

\bibitem[BB90]{BeBo90}
G.~Berry and G.~Boudol.
\newblock The chemical abstract machine.
\newblock In {\em Principles of Programming Languages}, pages 81--94, 1990.

\bibitem[Bur84]{Bur84}
F.W. Burton.
\newblock Annotations to control parallelism and reduction order in the
  distributed evaluation of functional programs.
\newblock {\em TOPLAS}, 6:159--174, 1984.

\bibitem[BvEG{\etalchar{+}}87]{BEGKPS87}
H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J.
  Plasmeijer, and M.R. Sleep.
\newblock Term graph rewriting.
\newblock In J.~W. de~Bakker, A.~J. Nijman, and P.~C. Treleaven, editors, {\em
  Proc. PARLE'87 Conference}, pages 141--158. Springer-Verlag, 1987.
\newblock LNCS vol.259.

\bibitem[EN84]{EnN86}
U.~Engberg and M.~Nielsen.
\newblock A calculus of communicating systems with label passing.
\newblock Technical Report DAIMI PB-205, Computer Science Department,
  University of Aarhus, 1984.

\bibitem[GKS91]{GKS91}
J.R.W. Glauert, J.R. Kennaway, and M.R. Sleep.
\newblock Dactl: An experimental graph rewriting language.
\newblock In H.~Ehrig, H.-J. Kreowski, and G.~Rozenberg, editors, {\em Proc.
  4th International Workshop on Graph Grammars and their Application to
  Computer Science}, volume 532 of {\em LNCS}. Springer-Verlag, 1991.

\bibitem[GMP89]{GPM89}
A.~Giacalone, P.~Mishra, and S.~Prasad.
\newblock Facile: A symmetric integration of concurrent and functional
  programming.
\newblock {\em IJPP}, 18(2):121--160, 1989.

\bibitem[GP88]{GlaPap88}
J.R.W. Glauert and G.A. Papadopoulos.
\newblock A parallel implementation of ghc.
\newblock In {\em Proceedings, International Conference on Fifth Generation
  Computer Systems, ICOT, Tokyo}, 1988.

\bibitem[GP91]{GlaPap91}
J.R.W. Glauert and G.A. Papadopoulos.
\newblock Unifying concurrent logic and functional languages in a graph
  rewriting framework.
\newblock In {\em Proceedings, 3rd Panhellenic Computer Science Conference.
  Athens}, 1991.

\bibitem[HT91]{HoTo91}
K.~Honda and M.~Tokoro.
\newblock An object calculus for asynchronous communication.
\newblock In {\em Proceedings, ECOOP'91, Geneva}, 1991.

\bibitem[Ken90]{Ken90}
J.R. Kennaway.
\newblock Implementing term rewrite languages in dactl.
\newblock {\em Th. Comp. Sci.}, 72:225--250, 1990.

\bibitem[KS91]{KeSl82}
J.R. Kennaway and M.R. Sleep.
\newblock Expressions as processes.
\newblock In {\em Proceedings, Lisp and FP}, pages 21--28, 1991.

\bibitem[Let91]{Leth91}
L.~Leth.
\newblock {\em Functional Programs as Reconfigurable Networks of Communicating
  Processes}.
\newblock PhD thesis, Imperial College, London University, 1991.

\bibitem[Mil90]{Mil90}
R.~Milner.
\newblock Functions as processes.
\newblock In {\em Automata, Languages, and Programming, Also Technical Report
  INRIA Sophia Antipolis, 1989}, volume 443 of {\em LNCS}. Springer-Verlag,
  1990.

\bibitem[Mil91]{PolyPi}
R.~Milner.
\newblock The \ppc: A tutorial.
\newblock Technical Report TR ECS-LFCS-91-180, Edinburgh University, 1991.

\bibitem[MPW89]{MPW89}
R.~Milner, J.~Parrow, and D.~Walker.
\newblock A calculus of mobile processes, parts i and ii.
\newblock Technical Report TR ECS-LFCS-89-85, Edinburgh University, 1989.

\bibitem[Tho89]{Tho89}
B.~Thomsen.
\newblock A calculus of higher order communicating systems.
\newblock In {\em Principles of Programming Languages}, pages 143--154, 1989.

\bibitem[Tho90]{Tho90}
B.~Thomsen.
\newblock {\em Calculi for Higher Order Communicating Systems}.
\newblock PhD thesis, Imperial College, London University, 1990.

\end{thebibliography}