1. José Barros. Semantics of non-terminating systems through term rewriting. Technical Report PRG-TR-21-95, Programming Research Group, Oxford University, June 1995. D.Phil. Thesis. Available through FTP at ftp.comlab.ox.ac.uk/pub/Documents/techreports/TR-21-95.ps.gz.
2. Jan Bergstra and John Tucker. Characterization of computable data types by means of a finite equational specification method. In Automata, Languages and Programming, Seventh Colloquium, pages 76–90. Springer-Verlag, July 1980. Lecture Notes in Computer Science, Volume 85; also, Preprint IW 124, Mathematisch Centrum, Department of Computer Science, Amsterdam, November, 1979.
3. Steven Bloom. Varieties of ordered algebras. Journal of Computer and System Sciences, 13:200–212, 1976.
4. G. Boudol. Computational semantics of term rewriting systems. In Algebraic Methods in Semantics, pages 167–236. Cambridge University Press, 1985.
5. Y. Chen and M. O'Donnell. Infinite terms and infinite rewritings. In 2nd International Workshop on Conditional and Typed Rewriting Systems, pages 45–52, 1990.