{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:40Z","timestamp":1725455860073},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017312","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:34Z","timestamp":1132644154000},"page":"203-213","source":"Crossref","is-referenced-by-count":2,"title":["Computable algebras, word problems and canonical term algebras"],"prefix":"10.1007","author":[{"given":"Herbert A.","family":"Klaeren","sequence":"first","affiliation":[]},{"given":"Martin","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"J.A. Bergstra, J.V. Tucker Algebraic specifications of computable and semicomputable data structures Math. Centrum Report IW 115\/1979"},{"issue":"11","key":"24_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/988056.988058","volume":"14","author":"J.A. Bergstra","year":"1979","unstructured":"J.A. Bergstra, J.V. Tucker On the adequacy of finite equational methods for data type specification SIGPLAN Notices 14 (1979), No. 11, 13\u201318","journal-title":"SIGPLAN Notices"},{"key":"24_CR3","unstructured":"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"},{"key":"24_CR4","unstructured":"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\u2013144"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"G. Huet, D.C. Oppen Equations and rewrite rules: a survey Formal languages: Perspectives and Open Problems, R. Book (ed), Academic Press, 1980","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"24_CR6","unstructured":"M. Schulz Berechenbare Algebren, Wortprobleme und kanonische Term-Algebren Diplomarbeit, Aachen 1981"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013132","DOI":"10.1145\/800133.804340"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017312.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:13Z","timestamp":1607549893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0017312","relation":{},"subject":[]}}