{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:29:50Z","timestamp":1774596590021,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540100034","type":"print"},{"value":"9783540393467","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_61","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:01:40Z","timestamp":1330189300000},"page":"76-90","source":"Crossref","is-referenced-by-count":48,"title":["A characterisation of computable data types by means of a finite equational specification method"],"prefix":"10.1007","author":[{"given":"J. A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"J. V.","family":"Tucker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"8_CR1","unstructured":"BERGSTRA, J.A. & J.V. TUCKER, Algebraic specifications of computable and semi-computable data structures, Mathematical Centre, Department of Computer Science Research Report IW 115, Amsterdam, 1979."},{"key":"8_CR2","unstructured":"\u2014, A characterisation of computable data types by means of a finite, equational specification method, Mathematical Centre, Department of Computer Science Research Report IW 124, Amsterdam, 1979."},{"key":"8_CR3","unstructured":"\u2014, Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds, Mathematical Centre, Department of Computer Science Research Report IW 128, Amsterdam, 1980."},{"key":"8_CR4","unstructured":"\u2014, On bounds for the specification of finite data types by means of equations and conditional equations, Mathematical Centre, Department of Computer Science Research Report IW 131, Amsterdam, 1980."},{"issue":"11","key":"8_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/988056.988058","volume":"14","author":"J. A. Bergstra","year":"1979","unstructured":"\u2014, On the adequacy of finite equational methods for data type specification, ACM-SIGPLAN Notices 14 (11) (1979) 13\u201318.","journal-title":"ACM-SIGPLAN Notices"},{"key":"8_CR6","first-page":"80","volume-title":"Current trends in programming methodology IV, Data structuring","author":"J. A. Goguen","year":"1978","unstructured":"GOGUEN, J.A., J.W. THATCHER & E.G. WAGNER, An initial algebra approach to the specification, correctness and implementation of abstract data types, in R.T. YEH (ed.) Current trends in programming methodology IV, Data structuring, Prentice-Hall, Engelwood Cliffs, New Jersey, 1978, 80\u2013149."},{"issue":"3","key":"8_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/988071.988075","volume":"14","author":"S. Kamin","year":"1979","unstructured":"KAMIN, S., Some definitions for algebraic data type specifications, SIGPLAN Notices 14 (3) (1979) 28\u201337.","journal-title":"SIGPLAN Notices"},{"key":"8_CR8","volume-title":"An introduction to the general theory of algorithms","author":"M. Machtey","year":"1978","unstructured":"MACHTEY, M. & P. YOUNG, An introduction to the general theory of algorithms, North-Holland, New York, 1978."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","volume":"16","author":"A. I. Mal'cev","year":"1961","unstructured":"MAL'CEV, A.I., Constructive algebras, I., Russian Mathematical Surveys, 16 (1961) 77\u2013129.","journal-title":"Russian Mathematical Surveys"},{"key":"8_CR10","first-page":"341","volume":"95","author":"M. O. Rabin","year":"1960","unstructured":"RABIN, M.O., Computable algebra, general theory and the theory of computable fields, Transactions American Mathematical Society, 95 (1960) 341\u2013360.","journal-title":"Transactions American Mathematical Society"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B. K. Rosen","year":"1973","unstructured":"ROSEN, B.K., Tree manipulating systems and Church-Rosser theorems, J. Association Computing Machinery, 20 (1973) 160\u2013187.","journal-title":"J. Association Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:33:06Z","timestamp":1619555586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980]]}}}