1. Ariola, Z.M. and J.W. Klop (1996). Equational Term Graph Gewriting, Fundamentae Informaticae, Vol. 26, Nrs. 3, 4, pp. 207–240.
2. Barendregt, H.P. (1984). The Lambda Calculus: Its Syntax and Semantics, Studies in Logic 103, second, revised edition, North-Holland, Amsterdam.
3. Barendregt, H.P., M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer and M.R. Sleep (1987). Term graph reduction, in: J.W. de Bakker, A.J. Nijman and P.C. Treleaven (eds.), Proceedings of the Conference on Parallel Architectures and Languages Europe (PARLE) II, Eindhoven, The Netherlands, Lecture Notes in Computer Science 259, Springer-Verlag, Berlin, pp. 141–158.
4. Barendsen, E. (1995). Types and Computations in Lambda Calculi and Graph Rewrite Systems, Dissertation, University of Nijmegen.
5. Barendsen, E. and J.E.W. Smetsers (1993). Conventional and uniqueness typing in graph rewrite systems (extended abstract), in: R.K. Shyamasundar (ed.), Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Bombay, India, Lecture Notes in Computer Science 761, Springer-Verlag, Berlin, pp. 41–51. Full paper: see Technical Report CSI-R9328, University of Nijmegen, and Barendsen (1995).