{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:28:21Z","timestamp":1648949301551},"reference-count":49,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"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":10882,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,10]]},"DOI":"10.1016\/0022-0000(83)90045-4","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"304-330","source":"Crossref","is-referenced-by-count":4,"title":["Implementation of data types by algebraic methods"],"prefix":"10.1016","volume":"27","author":[{"given":"Edward K.","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Parisi-Presicce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90045-4_BIB1","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\/0022-0000(83)90045-4_BIB2","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/359657.359666","article-title":"Abstract data types and software validation","volume":"21","author":"Guttag","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(83)90045-4_BIB3","series-title":"Abstract Software Specifications","first-page":"248","article-title":"An introduction to data algebras","volume":"Vol. 86","author":"Zilles","year":"1980"},{"key":"10.1016\/0022-0000(83)90045-4_BIB4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial Algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90045-4_BIB5","first-page":"80","article-title":"Abstract data types as initial algebras and the correctness of data representation","volume":"Vol. 4","author":"Goguen","year":"1978"},{"key":"10.1016\/0022-0000(83)90045-4_BIB6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01752396","article-title":"Relative complexity of algebras","volume":"14","author":"Blum","year":"1981","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(83)90045-4_BIB7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02485424","article-title":"A generalization of the homomorphism concept","volume":"7","author":"Blum","year":"1977","journal-title":"Algebra Universalis"},{"key":"10.1016\/0022-0000(83)90045-4_BIB8","series-title":"Proceedings, third IBM Symposium on Mathematical Foundations of Computer Science","first-page":"1","article-title":"Machines, Algebras and axioms","author":"Blum","year":"1978"},{"key":"10.1016\/0022-0000(83)90045-4_BIB9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/954627.954630","article-title":"Limits on the algebraic specification of abstract data types","volume":"Vol. 12","author":"Majster","year":"1977","journal-title":"SIGPLAN Notices,"},{"key":"10.1016\/0022-0000(83)90045-4_BIB10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/988056.988058","article-title":"On the adequacy of finite equational methods for data types specification","volume":"Vol. 14","author":"Bergstra","year":"1979","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0022-0000(83)90045-4_BIB11","series-title":"Proceedings, MFCS 78","first-page":"155","article-title":"Extensions and implementations of abstract data type specifications","volume":"Vol. 64","author":"Enrich","year":"1978"},{"issue":"1","key":"10.1016\/0022-0000(83)90045-4_BIB12","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/322290.322303","article-title":"On the theory of specification, implementation and parametrization of abstract data types","volume":"29","author":"Enrich","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90045-4_BIB13","series-title":"Proceedings, 5th ICALP","first-page":"205","article-title":"Stepwise specification and implementation of abstract data types","volume":"Vol. 62","author":"Ehrig","year":"1978"},{"key":"10.1016\/0022-0000(83)90045-4_BIB14","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(81)90014-3","article-title":"Complexity of algebraic implementations for abstract data types","volume":"23","author":"Ehrig","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB15","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/S0022-0000(69)80016-4","article-title":"Towards a theory of semantics and compilers for programming languages","volume":"3","author":"Blum","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB16","series-title":"Universal Algebra","author":"Gratzer","year":"1968"},{"key":"10.1016\/0022-0000(83)90045-4_BIB17","series-title":"Universal Algebra","author":"Cohn","year":"1965"},{"key":"10.1016\/0022-0000(83)90045-4_BIB18","series-title":"Proceedings, 13th ACM Symp. on Theory of Computing","article-title":"On the faithful regular extensions of iterative algebras","author":"Parisi-Presicce","year":"1981"},{"key":"10.1016\/0022-0000(83)90045-4_BIB19","series-title":"Proceedings, MFCS 78","first-page":"16","article-title":"The algebraic semantics of recursive program schemes","volume":"Vol. 64","author":"Courcelle","year":"1978"},{"key":"10.1016\/0022-0000(83)90045-4_BIB20","article-title":"Parameterized specifications: parameter passing and optimizing implementation","author":"Ganzinger","year":"1981","journal-title":"Tech. U. Munich-18110"},{"key":"10.1016\/0022-0000(83)90045-4_BIB21","series-title":"Proceedings, ICALP 80","first-page":"142","article-title":"Algebraic implementation of abstract data types: concept, syntax, semantics, and correctness","volume":"Vol. 85","author":"Ehrig","year":"1980"},{"key":"10.1016\/0022-0000(83)90045-4_BIB46","unstructured":"Theoret. Comput. Sci., in press."},{"key":"10.1016\/0022-0000(83)90045-4_BIB22","series-title":"Proceeding, 7th ICALP","first-page":"157","article-title":"Parameter passing in algebraic spcification languages","volume":"Vol. 85","author":"Ehrig","year":"1980"},{"key":"10.1016\/0022-0000(83)90045-4_BIB23","series-title":"Proceedings, 9th Symp. on Math. Found. of Comp. Sci.","first-page":"291","article-title":"Abstract implementation of abstract data types","volume":"Vol. 88","author":"Hupbach","year":"1980"},{"key":"10.1016\/0022-0000(83)90045-4_BIB24","series-title":"Logic Colloquium 73","first-page":"175","article-title":"Monadic computation and iterative algebraic theories","volume":"Vol. 80","author":"Elgot","year":"1975"},{"key":"10.1016\/0022-0000(83)90045-4_BIB25_1","first-page":"103","article-title":"Fixed-points and algebras with infinitely long expressions. I. Regular algebras","volume":"2","author":"Tiuryn","year":"1978","journal-title":"Fund. Inform."},{"key":"10.1016\/0022-0000(83)90045-4_BIB25_2","first-page":"317","article-title":"Fixed-points and algebras with infinitely long expressions. II. Regular algebras","volume":"2","author":"Tiuryn","year":"1979","journal-title":"Fund. Inform."},{"issue":"3","key":"10.1016\/0022-0000(83)90045-4_BIB26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(80)90056-0","article-title":"Unique fixed points vs least fixed points","volume":"12","author":"Tiuryn","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0022-0000(81)90006-4","article-title":"Recursion-closed algebraic theories","volume":"23","author":"Gallier","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB28","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(73)80040-6","article-title":"Program schemes, recursion schemes and formal languages","volume":"7","author":"Garland","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB29","series-title":"MFCS 1978","article-title":"Programming languages as mathematical objects","volume":"Vol. 64","author":"Thatcher","year":"1978"},{"key":"10.1016\/0022-0000(83)90045-4_BIB30","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0022-0000(78)90016-8","article-title":"On some classes of interpretations","volume":"17","author":"Courcelle","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB31","series-title":"Proceedings, Symposium on Computer and Automata","article-title":"Towards a mathematical semantics for computer languages","volume":"Vol. 21","author":"Scott","year":"1972"},{"key":"10.1016\/0022-0000(83)90045-4_BIB32","series-title":"Automata, Languages and Programming","first-page":"253","article-title":"Comparing algebraic structures up to algorithmic equivalence","author":"Kfoury","year":"1973"},{"key":"10.1016\/0022-0000(83)90045-4_BIB33_1","article-title":"IO and IO. I. II","volume":"15","author":"Englefriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB33_2","article-title":"IO and IO. I. II","volume":"16","author":"Englefriet","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB34","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0022-0000(74)80031-0","article-title":"A generalized approach to formal languages","volume":"8","author":"Mailbaum","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB35","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0022-0000(76)80003-7","article-title":"The existence and construction of free iterative theories","volume":"12","author":"Bloom","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB36","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0022-0000(79)90032-1","article-title":"Regular trees and the free iterative theory","volume":"18","author":"Ginalt","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90045-4_BIB37","article-title":"Algebraic semantics","volume":"Vol. 99","author":"Guessarian","year":"1981"},{"issue":"8","key":"10.1016\/0022-0000(83)90045-4_BIB38","doi-asserted-by":"crossref","DOI":"10.1145\/355609.362336","article-title":"Inductive methods for Proving Properties of Programs","volume":"16","author":"Manna","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(83)90045-4_BIB39","first-page":"RC 5369","article-title":"An Introduction to Categories, Algebraic Theories and Algebras","author":"Goguen","year":"1975","journal-title":"IBM"},{"key":"10.1016\/0022-0000(83)90045-4_BIB40_1","first-page":"263 ff","article-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0022-0000(83)90045-4_BIB40_2","first-page":"347 ff","article-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0022-0000(83)90045-4_BIB41","first-page":"194","article-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(83)90045-4_BIB42","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","article-title":"Characterizing derivation trees of context-free grammars through a generalization of finite automata theory","volume":"1","author":"Thatcher","year":"1967","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0022-0000(83)90045-4_BIB43","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1137\/0211016","article-title":"Continuous data types","volume":"11","author":"Levy","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90045-4_BIB44","series-title":"Proceedings, 9th ICALP","article-title":"Implementation of parametrized specifications","volume":"Vol. 140","author":"Sannella","year":"1982"},{"key":"10.1016\/0022-0000(83)90045-4_BIB45","unstructured":"M. Broy, B. Moller, P. Pepper, and M. Wirsing, A model-independent approach to implementation of abstract data types, in \u201cProceedings, Symp. on Algorithmic Logic and the Programming Language LOGLAN, Poznam, Poland\u201d, Lecture Notes in Computer Science, to appear."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900454?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900454?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:04Z","timestamp":1550325064000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["0022000083900454"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90045-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}