1. Banach R. (1996); Locating the Contractum in the Double Pushout Approach, Theoretical Computer Science 156, to appear.
2. Banach, R. (1994); Term Graph Rewriting and Garbage Collection Using Opfibrations, Theoretical Computer Science 131, 29–94.
3. Barendregt H.P., van Eekelen M.C.J.D., Glauert J.R.W., Kennaway J.R., Plasmeijer M.J., Sleep M.R. (1987); Term Graph Rewriting, in: Proc. PARLE-87, de Bakker J.W., Nijman A.J., eds., Lecture Notes in Computer Science 259 141–158, Springer, Berlin.
4. Ehrig H. (1979); Introduction to the Algebraic Theory of Graph Grammars (A survey), in: Lecture notes in Computer Science 73, 1–69, Springer, Berlin.
5. Ehrig H. (1986); A Tutorial Introduction to the Algebraic Approach of Graph Grammars, in: Third International Workshop on Graph Grammars, Lecture Notes in Computer Science 291, 3–14, Springer, Berlin.