{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T02:56:02Z","timestamp":1783392962415,"version":"3.54.6"},"reference-count":58,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0304-3975(87)90123-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"137-181","source":"Crossref","is-referenced-by-count":71,"title":["Algebraic specifications of computable and semicomputable data types"],"prefix":"10.1016","volume":"50","author":[{"given":"J.A.","family":"Bergstra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.V.","family":"Tucker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90123-X_BIB1","series-title":"Proc. Mathematical Foundations of Computer Science 1981","first-page":"193","article-title":"On the power of algebraic specifications","volume":"118","author":"Bergstra","year":"1981"},{"key":"10.1016\/0304-3975(87)90123-X_BIB2","first-page":"531","article-title":"On specifying sets of integers","volume":"20","author":"Bergstra","year":"1984","journal-title":"Elektron. Informationsverarb. Kybernet."},{"issue":"11","key":"10.1016\/0304-3975(87)90123-X_BIB3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/988056.988058","article-title":"On the adequacy of finite equational methods for data type specifications","volume":"14","author":"Bergstra","year":"1979","journal-title":"ACM-Sigplan Notices"},{"key":"10.1016\/0304-3975(87)90123-X_BIB4","series-title":"Department of Computer Science Research Rept. IW 115","article-title":"Algebraic specifications of computable and semicomputable data structures","author":"Bergstra","year":"1979"},{"key":"10.1016\/0304-3975(87)90123-X_BIB5","series-title":"Proc. 7th ICALP","first-page":"76","article-title":"A characterisation of computable data types by means of a finite, equational specification method","author":"Bergstra","year":"1980"},{"key":"10.1016\/0304-3975(87)90123-X_BIB6","series-title":"Department Computer Science Research Rept. IW 128","article-title":"Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds","author":"Bergstra","year":"1980"},{"key":"10.1016\/0304-3975(87)90123-X_BIB7","series-title":"Department Computer Science Research Rept. IW 131","article-title":"On bounds for the specification of finite data types by means of equations and conditional equations","author":"Bergstra","year":"1980"},{"key":"10.1016\/0304-3975(87)90123-X_BIB8","first-page":"23","article-title":"A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification","volume":"11","author":"Bergstra","year":"1980","journal-title":"Bulletin EATCS"},{"key":"10.1016\/0304-3975(87)90123-X_BIB9","series-title":"Proc. 8th ICALP","first-page":"348","article-title":"Algebraically specified programming systems and Hoare's logic","volume":"115","author":"Bergstra","year":"1981"},{"key":"10.1016\/0304-3975(87)90123-X_BIB10","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1137\/0212024","article-title":"Initial and final algebra semantics for data type specifications: two characterisation theorems","volume":"12","author":"Bergstra","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(87)90123-X_BIB11","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(82)80021-1","article-title":"The completeness of the algebraic specification methods for data types","volume":"54","author":"Bergstra","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(87)90123-X_BIB12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0022-0000(82)90013-7","article-title":"Expressiveness and the completeness of Hoare's logic","volume":"25","author":"Bergstra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90123-X_BIB13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00264252","article-title":"The axiomatic semantics of programs based on Hoare's logic","volume":"21","author":"Bergstra","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(87)90123-X_BIB14","series-title":"Proc. 6th ICALP","first-page":"72","article-title":"Existential quantifiers in abstract data types","author":"Broy","year":"1979"},{"key":"10.1016\/0304-3975(87)90123-X_BIB15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF00625280","article-title":"Partial abstract types","volume":"18","author":"Broy","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(87)90123-X_BIB16","series-title":"Universal Algebra","author":"Cohn","year":"1965"},{"key":"10.1016\/0304-3975(87)90123-X_BIB17","first-page":"89","article-title":"Abstract data types as initial algebras and correctness of data representations","author":"Goguen","year":"1975","journal-title":"Proc. ACM Conference on Computer Graphics, Pattern Recognition and Data Structure"},{"key":"10.1016\/0304-3975(87)90123-X_BIB18","series-title":"Current Trends in Programming Methodology; IV, Data Structuring","first-page":"80","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(87)90123-X_BIB19","series-title":"Universal Algebra","author":"Gr\u00e4tzer","year":"1968"},{"key":"10.1016\/0304-3975(87)90123-X_BIB20","year":"1978"},{"key":"10.1016\/0304-3975(87)90123-X_BIB21","article-title":"The specification and application to programming of abstract data types","author":"Guttag","year":"1975"},{"key":"10.1016\/0304-3975(87)90123-X_BIB22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","article-title":"The algebraic specification of abstract data types","volume":"10","author":"Guttag","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(87)90123-X_BIB23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(86)90173-8","article-title":"Partial evaluation and \u03c9-completeness of algebraic specifications","volume":"43","author":"Heering","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90123-X_BIB24","first-page":"11","article-title":"Correspondence from members","volume":"13","author":"Hilfinger","year":"1978","journal-title":"ACM-Sigplan Notices"},{"key":"10.1016\/0304-3975(87)90123-X_BIB25","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(87)90123-X_BIB26","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","article-title":"Proof of correctness of data representations","volume":"1","author":"Hoare","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(87)90123-X_BIB27","series-title":"Structured Programming","article-title":"Notes on data structuring","author":"Hoare","year":"1972"},{"key":"10.1016\/0304-3975(87)90123-X_BIB28","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/953411.953416","article-title":"A note on some limits of the algebraic specification methods","volume":"13","author":"Jones","year":"1978","journal-title":"ACM-Sigplan Notices"},{"key":"10.1016\/0304-3975(87)90123-X_BIB29","series-title":"Bibliography on Abstract Data Types","author":"Kutzler","year":"1983"},{"key":"10.1016\/0304-3975(87)90123-X_BIB30","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/988071.988075","article-title":"Some definitions for algebraic data type specifications","volume":"14","author":"Kamin","year":"1979","journal-title":"ACM-Sigplan Notices"},{"key":"10.1016\/0304-3975(87)90123-X_BIB31","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/988090.988096","article-title":"Specifications of Majster's traversable stack and Veloso's traversable stack","volume":"14","author":"Kapur","year":"1979","journal-title":"ACM-Sigplan Notices"},{"key":"10.1016\/0304-3975(87)90123-X_BIB32","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(84)90062-8","article-title":"A constructive method for abstract algebraic software specification","volume":"30","author":"Klaeren","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90123-X_BIB33","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1978"},{"key":"10.1016\/0304-3975(87)90123-X_BIB34","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1109\/TSE.1975.6312816","article-title":"Specification techniques for data abstractions","volume":"SE-1","author":"Liskov","year":"1975","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0304-3975(87)90123-X_BIB35","series-title":"Proc. 8th ICALP","first-page":"129","article-title":"Algorithmic specifications of data types","volume":"115","author":"Loeckx","year":"1981"},{"key":"10.1016\/0304-3975(87)90123-X_BIB36","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"key":"10.1016\/0304-3975(87)90123-X_BIB37","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/954627.954630","article-title":"Limits of the \u201calgebraic\u201d specification of abstract data types","volume":"12","author":"Majster","year":"1977","journal-title":"ACM-Sigplan Notices"},{"key":"10.1016\/0304-3975(87)90123-X_BIB38","first-page":"89","volume":"8","author":"Majster","year":"1979","journal-title":"Data types, abstract data types and their specification problem, Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90123-X_BIB39","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","article-title":"Constructive algebras I","volume":"16","author":"Mal'cev","year":"1961","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/0304-3975(87)90123-X_BIB40","series-title":"Algorithms and Recursive Functions","author":"Mal'cev","year":"1970"},{"key":"10.1016\/0304-3975(87)90123-X_BIB41","series-title":"Algebraic Systems","author":"Mal'cev","year":"1973"},{"key":"10.1016\/0304-3975(87)90123-X_BIB42","series-title":"Algebraic Methods in Semantics","article-title":"Initiality, induction and computability","author":"Meseguer","year":"1985"},{"key":"10.1016\/0304-3975(87)90123-X_BIB43","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1145\/361598.361623","article-title":"On the criteria to be used in decomposing systems into modules","volume":"15","author":"Parnas","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(87)90123-X_BIB44","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/355602.361309","article-title":"A technique for software module specification with examples","volume":"15","author":"Parnas","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(87)90123-X_BIB45","series-title":"Primzahlverteilung","author":"Prachar","year":"1957"},{"key":"10.1016\/0304-3975(87)90123-X_BIB46","first-page":"341","article-title":"Computable algebra, general theory and the theory of computable fields","volume":"98","author":"Rabin","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(87)90123-X_BIB47","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(87)90123-X_BIB48","series-title":"Theory of Groups","author":"Rotman","year":"1973"},{"key":"10.1016\/0304-3975(87)90123-X_BIB49","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/953411.953419","article-title":"On a finite axiomatisation of the data type L","volume":"13","author":"Subrahmanyam","year":"1978","journal-title":"ACM-Sigplan Notices"},{"key":"10.1016\/0304-3975(87)90123-X_BIB50","unstructured":"V. Stoltenberg-Hansen and J.V. Tucker, Computable algebra. An introduction to computable rings and fields, in preparation."},{"key":"10.1016\/0304-3975(87)90123-X_BIB51","article-title":"Specification of abstract data types using conditional axioms","author":"Thatcher","year":"1979","journal-title":"IBM Research Rept. RC 6214"},{"key":"10.1016\/0304-3975(87)90123-X_BIB52","article-title":"Data type specifications: parametrization and the power of specification techniques","author":"Thatcher","year":"1979","journal-title":"IBM Research Rept. RC 7757"},{"key":"10.1016\/0304-3975(87)90123-X_BIB53","unstructured":"J.V. Tucker and J.I. Zucker, Program correctness over abstract data types, with error-state semantics, Research Monograph, in preparation."},{"key":"10.1016\/0304-3975(87)90123-X_BIB54","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/954063.954070","article-title":"Traversable stack with fewer errors","volume":"14","author":"Veloso","year":"1979","journal-title":"ACM-Sigplan Notices"},{"key":"10.1016\/0304-3975(87)90123-X_BIB55","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","article-title":"Final algebra semantics and data type extensions","volume":"19","author":"Wand","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90123-X_BIB56","series-title":"Proc. 8th Symp. on Mathematical Foundations of Computer Science","article-title":"Abstract data types as lattices of finitely generated models","author":"Wirsing","year":"1980"},{"key":"10.1016\/0304-3975(87)90123-X_BIB57","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/BF01939551","article-title":"Numerical analysis as an independent science","volume":"6","author":"van Wijngaarden","year":"1966","journal-title":"BIT"},{"key":"10.1016\/0304-3975(87)90123-X_BIB58","series-title":"An introduction to data algebras","author":"Zilles","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758790123X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758790123X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:49Z","timestamp":1555127509000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758790123X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987]]}},"alternative-id":["030439758790123X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90123-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}