1. Andréka, H., Burmeister, B., Németi, I.: Quasivarieties of partial algebras ? a unifying approach towards a two-valued model theory for partial algebras. TH Darmstadt, FB Mathematik, Preprint Nr. 557
2. Bauer, F.L., Wössner, H.: Algorithmische Sprache und Programmentwicklung. Berlin-Heidelberg-New York: Springer 1981
3. Bergstra, J.A., Broy, M., Tucker, J.V., Wirsing, M.: On the power of algebraic specifications. In: Gruska, J. (ed.): 10th MFCS, Strbske Pleso, CSSR, Sept. 1981. LNCS118, 193?204 (1981)
4. Bergstra, J.A., Tucker, J.V.: A characterization of computable data types by means of a finite, equational specification method. Math. Centr. Rep. IWi24/79, 1979
5. Bertoni, A., Mauri, G., Miglioli, P.A., Wirsing, M.: On different approaches to abstract data types and the existence of recursive models. EATCS Bulletin No.9, 47?57 (1979)