\begin{thebibliography}{BEGKPS87}

\bibitem[{Abr88}]{Abr88}
S. Abramsky:
{\em The Lazy Lambda Calculus},     
Chapter 4 in D. Turner (ed.),
Research Topics in Functional Programming, 
pp. 65-116, Addison Wesley, 1988.

\bibitem[{Bar87}]{BEGKPS87}
H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R.
Kennaway, M.J. Plasmeijer, \& M.R. Sleep:
{\em Term Graph Rewriting},
Proc. PARLE 87, Springer LNCS 259, p141-158. (1987) 

\bibitem[{Ber90}]{BeBo90}
G. Berry \& G. Boudol:
{\em The  Chemical Abstract Machine} 
Proc. POPL 90, p 81-94. (1990) 

\bibitem[{Bur84}]{Bur84}
F.W. Burton: 
{\em Annotations to Control Parallelism and Reduction Order in
the Distributed Evaluation of Functional Programs} 
TOPLAS, Vol 6, No 4, p159-174. (1984) 

\bibitem[{Eng86}]{EnN86}
U. Engberg \& M. Nielsen: 
{\em A Calculus of Communicating Systems with Label Passing} 
Report DAIMI PB-205, Computer Science Department, University of Aarhus.
(1984) 

\bibitem[{Gia89}]{GPM89}
A. Giacalone, P. Mishra, \& S. Prasad:
{\em Facile: A Symmetric Integration of Concurrent and
Functional Programming} 
IJPP, Vol 18, No 2, p121-160. (1989) 

\bibitem[{Gla88}]{GlaPap88}
J.R.W. Glauert, \& G.A. Papadopoulos:
{\em A Parallel Implementation of GHC}
Proceedings, International Conference on Fifth Generation Computer Systems.
ICOT, Tokyo, December 1988. (1988)

\bibitem[{Gla91a}]{GlaPap91}
J.R.W. Glauert, \& G.A. Papadopoulos:
{\em Unifying Concurrent Logic and Functional Languages in a Graph
Rewriting Framework}
Proceedings, 3rd Panhellenic Computer Science Conference. Athens, May 1991.
(1991)

\bibitem [{Gla91b}]{GKS91}
J.R.W. Glauert, J.R. Kennaway, \& M.R. Sleep:
{\em Dactl: An Experimental Graph Rewriting Language}
Proc. 4th International Workshop on Graph Grammars, Bremen, 1990.
Springer LNCS 532. (1991)

\bibitem[{Hon91}]{HoTo91}
Honda, K., Tokoro, M.,
{\it An object calculus for asynchronous communication},
Proceedings, ECOOP'91, Geneva, July 1991. (1991)

\bibitem[{Ken82}]{KeSl82}
J.R. Kennaway and M.R. Sleep:
{\em Expressions as processes} 
Proceedings, Lisp and FP, Aug 1982, p.21-28. (1982) 

\bibitem[{Ken90}]{Ken90}
J.R. Kennaway:
{\em Implementing Term Rewrite Languages in Dactl} 
Theor. Comp. Sci. 72, p.225-250. (1990)

\bibitem[{Let91}]{Leth91}
L. Leth:
{\em Functional Programs as Reconfigurable Networks of
Communicating Processes}
Ph. D. Thesis, Imperial College, London University, 1991.

\bibitem[{Mil89}]{Mil89}
R. Milner:
{\em Communication and Concurrency},
Prentice Hall, 1989.

\bibitem[{Mil90}]{Mil90}
R. Milner: 
{\em Functions as Processes}
Automata, Languages, and Programming. Springer LNCS 443. (1990)
Also: Technical Report INRIA Sophia Antipolis, June 1989. 

\bibitem[{Mil91}]{PolyPi}
R. Milner: 
{\em The \PPC: A Tutorial},
Technical Report ECS-LFCS-91-180, Edinburgh University, October 1991.
(1991)

\bibitem[{MPW89}]{MPW89}
R. Milner, J. Parrow, \& D. Walker: 
{\em A Calculus of Mobile Processes} Parts I and II 
TR ECS-LFCS-89-85, Edinburgh University, June 1989. (1989) 

\bibitem[{Tho89}]{Tho89}
B. Thomsen:
{\em A Calculus of Higher Order Communicating Systems},
Proceedings of POPL 89, pp. 143-154,
The Association for Computing Machinery, 1989.

\bibitem[{Tho90}]{Tho90}
B. Thomsen:
{\em Calculi for Higher Order Communicating Systems},
Ph. D. Thesis, Imperial College, London University, 1990.

\end{thebibliography}