\newcommand{\bibnoop}[1]{}\newcommand{\bibsingleletter}[1]{#1}
\begin{thebibliography}{10}

\bibitem{Paragon}
{\sc Anderson, P., Bolton, D., and Kelly, P.}
\newblock Paragon specifications: Structure, analysis and implementation.
\newblock In PARLE '92 \cite{PARLE1992}.

\bibitem{CHAM}
{\sc Berry, G., and Boudol, G.}
\newblock The chemical abstract machine.
\newblock In {\em Proc. POPL '90\/} (1990), pp.~81--94.

\bibitem{Bou92}
{\sc Boudol, G.}
\newblock Asynchrony and the $\pi$-calculus (note).
\newblock Rapport de Recherche 1702, INRIA Sofia-Antipolis, May 1992.

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

\bibitem{Parle92}
{\sc Glauert, J. R.~W.}
\newblock Asynchronous mobile processes and graph rewriting.
\newblock In PARLE '92 \cite{PARLE1992}, pp.~63--78.

\bibitem{GraGraDac91}
{\sc Glauert, J. R.~W., Kennaway, J.~R., and Sleep, M.~R.}
\newblock Dactl: An experimental graph rewriting language.
\newblock In {\em Proc. 4th International Workshop on Graph Grammars and their
  Applications to Computer Science\/} (1991), vol.~532 of {\em LNCS},
  Springer-Verlag.

\bibitem{NewTrans}
{\sc Glauert, J. R.~W., Leth, L., and Thomsen, B.}
\newblock A new translation of functions as processes.
\newblock In Sleep et~al. \cite{TGR1993}, pp.~269--282.

\bibitem{ZAPPClean}
{\sc Goldsmith, R.~G., McBurney, D.~L., and Sleep, M.~R.}
\newblock Parallel execution of concurrent clean on zapp.
\newblock In Sleep et~al. \cite{TGR1993}, pp.~283--301.

\bibitem{MDFM}
{\sc Gurd, J.~R., Kirkham, C.~C., and Watson, I.}
\newblock The {Manchester} prototype dataflow computer.
\newblock {\em Commun. ACM 26}, 1 (1985), 34--52.

\bibitem{HonTok91}
{\sc Honda, K., and Tokoro, M.}
\newblock An object calculus for asynchronous communication.
\newblock In {\em Proc. ECOOP'91\/} (1991), Geneva.

\bibitem{DistribFacile}
{\sc Kramer, A., and Cosquer, F.}
\newblock Distributing facile.
\newblock {\em MAGIC Note 12, ECRC\/} (1991).

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

\bibitem{FacileCHAM}
{\sc Leth, L., and Thomsen, B.}
\newblock Some facile chemistry.
\newblock {\em ECRC Technical Report ECRC-92-14\/} (1992).

\bibitem{ZAPP}
{\sc McBurney, D.~L., and Sleep, M.~R.}
\newblock Transputer-based experiments with the zapp architecture.
\newblock In {\em Proc. PARLE '87\/} (1987), vol.~258 of {\em LNCS},
  Springer-Verlag.

\bibitem{CCS}
{\sc Milner, R.}
\newblock A calculus of communicating systems.
\newblock {\em LNCS 92\/} (1980).

\bibitem{FunAsProcs}
{\sc Milner, R.}
\newblock Functions as processes.
\newblock In {\em Proc. Automata, Languages, and Programming '90\/} (1990),
  vol.~443 of {\em LNCS}, Springer-Verlag.

\bibitem{PolyPi}
{\sc Milner, R.}
\newblock The polyadic $\pi$--calculus: A tutorial.
\newblock {\em Technical Report ECS-LFCS-91-180\/} (1991).

\bibitem{Pi}
{\sc Milner, R., Parrow, J., and Walker, D.}
\newblock A calculus of mobile processes, {Parts} {I} and {II}.
\newblock {\em Technical Report ECS-LFCS-89-85\/} (1989).

\bibitem{PARLE1992}
{\em Proc. PARLE '92\/} (June 1992), vol.~605 of {\em LNCS}, Springer-Verlag.

\bibitem{Shapiro}
{\sc Shapiro, E.~Y.}
\newblock The family of concurrent logic programming languages.
\newblock {\em Computing Surveys 21}, 3 (1989), 412--510.

\bibitem{TGR1993}
{\sc Sleep, M.~R., Plasmeijer, M.~J., and van Eekelen, M. C. J.~D.}, Eds.
\newblock {\em Term Graph Rewriting: Theory and Practice}.
\newblock Wiley, 1993.

\bibitem{AM}
{\sc van Eicken, T., Culler, D.~E., Goldstein, S.~C., and Schauser, K.~E.}
\newblock Active messages: a mechanism for integrated communication and
  computation.
\newblock In {\em International Symposium on Computer Architecture '92\/}
  (1992), ACM.

\end{thebibliography}