{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:45:23Z","timestamp":1648881923380},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":8720,"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":[[1989,9]]},"DOI":"10.1016\/0304-3975(89)90024-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"87-97","source":"Crossref","is-referenced-by-count":3,"title":["On a conjecture of Bergstra and Tucker"],"prefix":"10.1016","volume":"67","author":[{"given":"G.","family":"Marongiu","sequence":"first","affiliation":[]},{"given":"S.","family":"Tulipani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90024-8_BIB1","article-title":"The Lambda Calculus, its Syntax and Semantics","volume":"Vol. 103","author":"Barendregt","year":"1981"},{"key":"10.1016\/0304-3975(89)90024-8_BIB2","series-title":"Dept. of Computer Science Research Report IW 115","article-title":"Algebraic specifications of computable and semicomputable data structures","author":"Bergstra","year":"1979"},{"key":"10.1016\/0304-3975(89)90024-8_BIB3","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1137\/0212024","article-title":"Initial and final algebra semantics for data type specifications: two characterization theorems","volume":"12","author":"Bergstra","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90024-8_BIB4","doi-asserted-by":"crossref","first-page":"106","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(89)90024-8_BIB5","article-title":"Algebraic specifications for computable and semicomputable","author":"Bergstra","year":"1986","journal-title":"Centre for Mathematics and Computer Science Report CS-R8619"},{"key":"10.1016\/0304-3975(89)90024-8_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.4064\/fm-124-3-221-233","article-title":"Equivalence relations induced by extensional formulae: classification by means of a new fixed point property","volume":"CXXIV","author":"Bernardi","year":"1984","journal-title":"Fund. Math."},{"key":"10.1016\/0304-3975(89)90024-8_BIB7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.2307\/2273443","article-title":"Classifying positive equivalence relations","volume":"48","author":"Bernardi","year":"1983","journal-title":"J. Symb. Logic"},{"key":"10.1016\/0304-3975(89)90024-8_BIB8","series-title":"EATCS Monograph","article-title":"Fundamentals of Algebraic Specification 1","author":"Ehrig","year":"1985"},{"key":"10.1016\/0304-3975(89)90024-8_BIB9","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/BF02218645","article-title":"Positive equivalences","volume":"10","author":"Ershov","year":"1973","journal-title":"Algebra and Logic"},{"key":"10.1016\/0304-3975(89)90024-8_BIB10","series-title":"Proc. ACM Conf. on Computer Graphics, Pattern Recognition and Data Structure","first-page":"89","article-title":"Abstract data types as initial algebras and correctness of data representations","author":"Goguen","year":"1975"},{"key":"10.1016\/0304-3975(89)90024-8_BIB11","series-title":"Introduction to Combinators and Lambda-Calculus","author":"Hindley","year":"1986"},{"key":"10.1016\/0304-3975(89)90024-8_BIB12","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(89)90024-8_BIB13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/malq.19870330106","article-title":"A note on positive equivalence relations","volume":"33","author":"Lachlan","year":"1987","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(89)90024-8_BIB14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/954627.954630","article-title":"Limits of the algebraic specification of abstract data types","volume":"12","author":"Magister","year":"1977","journal-title":"ACM Sigplan Notices"},{"key":"10.1016\/0304-3975(89)90024-8_BIB15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0304-3975(79)90059-8","article-title":"Data types, abstract data types and their specification problem","volume":"8","author":"Magister","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90024-8_BIB16","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. Surv."},{"key":"10.1016\/0304-3975(89)90024-8_BIB17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-17660-8_51","article-title":"Finite algebraic specifications of semicomputable data types","volume":"Vol. 249","author":"Marongiu","year":"1987"},{"key":"10.1016\/0304-3975(89)90024-8_BIB18","first-page":"341","article-title":"Computable algebra, general theory and the theory of computable fields","volume":"98","author":"Rabin","year":"1960","journal-title":"Trans. AMS"},{"key":"10.1016\/0304-3975(89)90024-8_BIB19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1305\/ndjfl\/1093956080","article-title":"Functionals defined by recursion","volume":"8","author":"Sanchis","year":"1967","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/0304-3975(89)90024-8_BIB20","article-title":"Data type specifications: parametrization and the power of specification techniques","author":"Thatcher","year":"1979","journal-title":"IBM Research Report RC 7757"},{"key":"10.1016\/0304-3975(89)90024-8_BIB21","first-page":"259","article-title":"Numerations, \u03bb-calculus and arithmetic","author":"Visser","year":"1980"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900248?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900248?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:20Z","timestamp":1555113380000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0304397589900248"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90024-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}