Amadio, R. M. and Cardelli, L. (1993) Subtyping recursive types. ACM Transactions on Programming Languages and Systems 15 (4)575–631.
Ariola, Z. M. and Klop, J. W. (1995) Equational term graph rewriting. Technical Report IR-391, Vrije Universiteit Amsterdam. (This is an extension of Ariola and Klop (1996).)
Ariola, Z. M. and Klop, J. W. (1996) Equational term graph rewriting. Fundamenta Informaticae 26 (3-4)207–240.
Blom, S. (2001) Term Graph Rewriting, Syntax and Sematics, Ph.D. thesis, Vrije Universiteit Amsterdam.
Brandt, M. and Henglein, F. (1998) Coinductive axiomatization of recursive type equality and subtyping. Fundamenta Informaticae 33 1–30.
Grabmayer, C. (2002a) A duality in proof systems for recursive type equality and bisimulation equivalence on cyclic term graphs. In: Plump, D. (ed.) Proceedings of TERMGRAPH 2002. Electronic Notes in Computer Science 72 (1).
Grabmayer, C. (2002b) A duality in proof systems for recursive type equality and bisimulation equivalence on cyclic term graphs. Technical Report IR-499, Dept. of Math. and Comp. Sci., Vrije Universiteit Amsterdam. (Available from the authors's home page.)
Grabmayer, C. (2005) Relating Proof Systems for Recursive Types, Ph.D. thesis, Vrije Universiteit Amsterdam.
Hurkens, A. J. C., McArthur, M., Moschovakis, Y., Moss, L. S. and Whitney, G. (1998) The logic of recursive equations. Journal of Symbolic Logic 63 (2)451–478.
Hüttel, H. and Stirling, C. (1991) Actions speak louder than words: Proving bisimilarity for context-free processes. In: Proceedings of LICS'91, IEEE Computer Society Press 376–386.
Klop, J. W. (2000) Proof systems for cyclic term graphs. Lecture at the Winter Workshop on Logics, Types and Rewriting, February 1-3 2000, Heriot-Watt University, Edinburgh. (Available at: http://www.cs.vu.nl/jwk/ctg1-41.pdf.)
Milner, R. (1984) A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences 28 439–466.
Moss, L. S. (2003) Recursion and corecursion have the same equational logic. Theoretical Computer Science 294 (1-2)233–267.
Rosu, G. and Goguen, J. (2001) Circular coinduction. In: Proceedings of IJCAR'01, Siena, Italy.
Salomaa, A. (1966) Two complete axiom systems for the algebra of regular events. Journal of the ACM 13 (13)158–169.
Sangiorgi, D. (1998) On the bisimulation proof method. Mathematical Structures in Computer Science 8 (5)447–479.
Troelstra, A. and Schwichtenberg, H. (2000) Basic Proof Theory, Cambridge University Press.