1. Bachmair, L., Dershowitz, N., and Hsiang, J. (1986). “Orderings for equational proofs,” In Proc. of the 1st Symposium on Logic in Computer Science, Cambridge, Mass. Washington, DC, IEEE Computer Society Press, 346–357.
2. Bergstra, J., and Klop, J. (1982). “Conditional rewriting rules: confluency and termination,” Report IW 198/92, Amsterdam.
3. Bergstra, J. A., Broy, M., Tucker, J. V., and Wirsing, M. (1981). “On the power of algebraic specifications,” Proc. of the 10th Conference on Mathematical Foundations of Computer Science, (J. Gruske, M. Chytil, eds.). Lecture Notes in Computer Science 118, Berlin, Springer-Verlag, 193–202.
4. Bidoit, M., and Choquer, M. A. (1985) “Preuves de formules conditionnelles par récurrence,” Proc. of the 5th AFCET Conference “Reconnaissance des formes et intelligence artificielle,” Grenoble, France. Vol. 1, Paris, AFCET, 329–344.
5. “Varieties of ‘IF-THEN-ELSE’,”;Bloom;SIAM Journal on Computing,1983