1. H. Aida, G. Goguen, and J. Meseguer. Compiling concurrent rewriting onto the rewrite rule machine. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal (Canada), volume 516 of LNCS, pages 320–332. Springer-Verlag, June 1990.
2. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and superposition. In Proceedings 11th International Conference on Automated Deduction, Saratoga Springs (N. Y., USA), pages 462–476, 1992.
3. J. A. Bergstra and J. W. Klop. Conditional rewrite rules: Confluency and termination. Journal of Computer and System Sciences, 32(3):323–362, 1986.
4. J. A. Bergstra and J. V. Tucker. A characterisation of computable data types by means of a finite equational specification method. In J.W. de Bakker and J. van Leuwen, editors, Proceedings 7th ICALP Conference, Noordwijkerhout, volume 81 of LNCS, pages 76–90. Springer-Verlag, 1980.
5. J. A. Bergstra and J. V. Tucker. Algebraic specifications of computable and semicomputable data structures. Theoretical Computer Science, 50:137–181, 1987.