1. S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and the foundations of typed concurrent programming. In Deductive Program Design, Nato ASI Series, pages 403–442. Springer Verlag, 1994.
2. Z.M. Ariola and J.W. Klop. Equational term graph rewriting. Fundamenta Informaticae, 26:207–240, 1996.
3. J.A. Bergstra and G. Stefanescu. Network algebra for synchronous and asynchronous dataflow. Technical Report Logic Group Preprint Series n. 122, Department of Philosophy, University of Utrecht, 1994.
4. R. Bruni, J. Meseguer, and U. Montanari. Process and term tile logic. Technical Report SRI-CSL-98-06, SRI International, 1998.
5. V.A. Cazanescu and G. Stefanescu. Classes of nite relations as initial abstract data types I. Discrete Mathematics, 90:233–265, 1991.