{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:54Z","timestamp":1725558474558},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_25","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"299-313","source":"Crossref","is-referenced-by-count":2,"title":["On Algebraic Specifications of Abstract Data Types"],"prefix":"10.1007","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1137\/0212024","volume":"12","author":"J. Bergstra","year":"1983","unstructured":"Bergstra, J., Tucker, J.: Initial and final algebra semantics for data type specifications: two characterisation theorems. SIAM Journal on Computing\u00a012(2), 366\u2013387 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(87)90123-X","volume":"50","author":"J. Bergstra","year":"1987","unstructured":"Bergstra, J., Tucker, J.: Algebraic Specifications of Computable and Semicomputable Data Types. Theoretical Computer Science\u00a050, 137\u2013181 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(82)80021-1","volume":"54","author":"J. Bergstra","year":"1982","unstructured":"Bergstra, J., Tucker, J.: The Completeness of the Algebraic Specification Methods for Computable Data Types. Information and Control\u00a054(3), 186\u2013200 (1982)","journal-title":"Information and Control"},{"key":"25_CR4","unstructured":"Goncharov, S., Khoussainov, B.: Computationally Complete Algebras, CDMTCS Research report, No 206, see Research Report Series in http:\/\/www.cs.auckland.ac.nz\/CDMTCS\/"},{"key":"25_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal Algebra","author":"G. Gr\u00e4tzer","year":"1979","unstructured":"Gr\u00e4tzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)","edition":"2"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Ershov, Y., Goncharov, S.: Constructive Models. Siberian School of Algebra and Logic Series. Consultants Bureau. Kluwer Academic, Plenum (2000)","DOI":"10.1007\/978-1-4615-4305-3_2"},{"issue":"6","key":"25_CR7","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/BF01988315","volume":"26","author":"N. Kasymov","year":"1987","unstructured":"Kasymov, N.: Algebras with Finitely Approximable Positively Representable Enrichments. Algebra and Logic\u00a026(6), 715\u2013730 (1987)","journal-title":"Algebra and Logic"},{"key":"25_CR8","first-page":"3","volume":"116","author":"N. Kasymov","year":"1986","unstructured":"Kasymov, N., Khoussainov, B.: Finitely Generated Enumerable and Absolutely Locally Finite Algebras. Vychisl. Systemy\u00a0(116), 3\u201315 (1986)","journal-title":"Vychisl. Systemy"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0168-0072(97)00040-7","volume":"91","author":"B. Khoussainov","year":"1998","unstructured":"Khoussainov, B.: Randomness, Computability, and Algebraic Specifications. Annals of Pure and Applied Logic\u00a091(1), 1\u201315 (1998)","journal-title":"Annals of Pure and Applied Logic"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01211084","volume":"9","author":"D. Sannella","year":"1997","unstructured":"Sannella, D., Tarlecki, A.: Essential Concepts of Algebraic Specification and Program Development. Formal Aspects of Computing\u00a09, 229\u2013269 (1997)","journal-title":"Formal Aspects of Computing"},{"key":"25_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R. Soare","year":"1987","unstructured":"Soare, R.: Recursively Enumerable Sets and Degrees. Springer, New York (1987)"},{"key":"25_CR12","first-page":"675","volume-title":"Handbook of Theoretical Computer Science: Formal Model and Semantics","author":"M. Wirsing","year":"1990","unstructured":"Wirsing, M.: Algebraic Specifications. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Formal Model and Semantics, vol.\u00a0B, pp. 675\u2013788. Elsevier, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T19:21:54Z","timestamp":1685647314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}