This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.A. Bergstra, J.V. Tucker Algebraic specifications of computable and semicomputable data structures Math. Centrum Report IW 115/1979
J.A. Bergstra, J.V. Tucker On the adequacy of finite equational methods for data type specification SIGPLAN Notices 14 (1979), No. 11, 13–18
J.A. Bergstra, J.V. Tucker Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds Math. Centrum Report IW 128/80, 1980
J.A. Goguen, J.W. Thatcher, J.B. Wright An initial algebra approach to the specification, correctness, and implementation of abstract data types Current Trends in Programming Methodology IV: Data Structuring, R. Yeh (ed.), Prentice Hall 1978, 80–144
G. Huet, D.C. Oppen Equations and rewrite rules: a survey Formal languages: Perspectives and Open Problems, R. Book (ed), Academic Press, 1980
M. Schulz Berechenbare Algebren, Wortprobleme und kanonische Term-Algebren Diplomarbeit, Aachen 1981
J.W. Thatcher, E.G. Wagner, J.B. Wright Data type specification: parameterization and the power of specification techniques Proc. 10th Symposium Theory of Computing (1978), 119–132
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klaeren, H.A., Schulz, M. (1981). Computable algebras, word problems and canonical term algebras. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017312
Download citation
DOI: https://doi.org/10.1007/BFb0017312
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive