{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:52:16Z","timestamp":1688489536306},"reference-count":32,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90098-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"167-196","source":"Crossref","is-referenced-by-count":14,"title":["Algebraic domain equations"],"prefix":"10.1016","volume":"27","author":[{"given":"Hans-Dieter","family":"Ehrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udo","family":"Lipeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90098-1_BIB1","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. ACM"},{"key":"10.1016\/0304-3975(83)90098-1_BIB2","first-page":"80","article-title":"An initial algebraic approach to the specification, correctness, and implementation of abstract data types","volume":"Vol. IV","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(83)90098-1_BIB3","first-page":"119","article-title":"Data type specification: Parameterization and the power of specification techniques","author":"Thatcher","year":"1978","journal-title":"Proc. 10th SIGACT STOC"},{"key":"10.1016\/0304-3975(83)90098-1_BIB4","series-title":"Arrows, Structures, and Functors","author":"Arbib","year":"1975"},{"key":"10.1016\/0304-3975(83)90098-1_BIB5","series-title":"Proc. 5th Internat. Joint Conf. on Artificial Intelligence","first-page":"1045","article-title":"Putting theories together to make specifications","author":"Burstall","year":"1977"},{"key":"10.1016\/0304-3975(83)90098-1_BIB6","first-page":"292","article-title":"The semantics of CLEAR, a specification language","volume":"86","author":"Burstall","year":"1980"},{"key":"10.1016\/0304-3975(83)90098-1_BIB7","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/322290.322303","article-title":"On the theory of specification, implementation, and parameterization of abstract data types","volume":"29","author":"Ehrich","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90098-1_BIB8","series-title":"Proc. 1981 FCT-Conf.","first-page":"120","article-title":"Specifying algebraic data types by domain equations","volume":"117","author":"Ehrich","year":"1981"},{"key":"10.1016\/0304-3975(83)90098-1_BIB9","series-title":"Graphs, Data Structures, Algorithms","first-page":"169","article-title":"Parametric specification of abstract data types, parameter substitution, and graph replacements","volume":"13","author":"Ehrich","year":"1979"},{"key":"10.1016\/0304-3975(83)90098-1_BIB10","series-title":"Proc. Internat. Workshop on Graph Grammars and Their Application to Computer Science and Biology","first-page":"180","article-title":"Constructing specifications of abstract data types by replacements","volume":"73","author":"Ehrich","year":"1979"},{"key":"10.1016\/0304-3975(83)90098-1_BIB11","series-title":"Proc. 7th ICALP","first-page":"157","article-title":"Parameterized data types in algebraic specification languages","volume":"85","author":"Ehrig","year":"1980"},{"key":"10.1016\/0304-3975(83)90098-1_BIB12","series-title":"Proc. Workshop on Program Specification","first-page":"322","article-title":"Parameter passing in algebraic specification languages","volume":"134","author":"Ehrig","year":"1981-1982"},{"key":"10.1016\/0304-3975(83)90098-1_BIB13","series-title":"Proc. Math. Studies of Information Processing","first-page":"425","article-title":"Some design principles and theory for OBJ-O","volume":"75","author":"Goguen","year":"1979"},{"key":"10.1016\/0304-3975(83)90098-1_BIB14","series-title":"Tech. Rept. CSRG-59","article-title":"The specification and application to programming of abstract data types","author":"Guttag","year":"1975"},{"key":"10.1016\/0304-3975(83)90098-1_BIB15","first-page":"221","article-title":"Data types as initial algebras: A unification of Scottery and ADJery","author":"Kanda","year":"1978","journal-title":"Proc. 19th FOCS"},{"key":"10.1016\/0304-3975(83)90098-1_BIB16","series-title":"Proc. 8th MFCS","first-page":"326","article-title":"Fully effective solutions of recursive domain equations","volume":"74","author":"Kanda","year":"1979"},{"key":"10.1016\/0304-3975(83)90098-1_BIB17","first-page":"122","article-title":"Categories for fixpoint semantics","author":"Lehmann","year":"1976","journal-title":"Proc. 17th IEEE FOCS"},{"key":"10.1016\/0304-3975(83)90098-1_BIB18","first-page":"7","article-title":"Data types","author":"Lehmann","year":"1977","journal-title":"Proc. 18th IEEE FOCS"},{"key":"10.1016\/0304-3975(83)90098-1_BIB19","series-title":"Habilitationsschrift","article-title":"Allgemeine Operatornetze als Fixpunktgleichungen","author":"Merzenich","year":"1980"},{"key":"10.1016\/0304-3975(83)90098-1_BIB20","series-title":"Internal Rept.","article-title":"Modular denotational semantics","author":"Mosses","year":"1979"},{"key":"10.1016\/0304-3975(83)90098-1_BIB21","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"Plotkin","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90098-1_BIB22","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","article-title":"[Pcy]\u03c9 as a universal domain","volume":"17","author":"Plotkin","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90098-1_BIB23","series-title":"Kategorien I, II","author":"Schubert","year":"1970"},{"key":"10.1016\/0304-3975(83)90098-1_BIB24","series-title":"Proc. Symp. on Semantics of Algorithmic Languages","first-page":"311","article-title":"The lattice of flow diagrams","volume":"188","author":"Scott","year":"1971"},{"key":"10.1016\/0304-3975(83)90098-1_BIB25","series-title":"Formal Semantics of Algorithmic Languages","first-page":"65","article-title":"Lattice theory, data types and semantics","author":"Scott","year":"1972"},{"key":"10.1016\/0304-3975(83)90098-1_BIB26","series-title":"Toposes, Algebraic Geometry and Logic","first-page":"97","article-title":"Continuous lattices","volume":"274","author":"Scott","year":"1972"},{"key":"10.1016\/0304-3975(83)90098-1_BIB27","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90098-1_BIB28","series-title":"Proc. 5th MFCS","first-page":"537","article-title":"Powerdomains","volume":"45","author":"Smyth","year":"1976"},{"key":"10.1016\/0304-3975(83)90098-1_BIB29","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","article-title":"Effectively given domains","volume":"5","author":"Smyth","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90098-1_BIB30","first-page":"13","article-title":"The category-theoretic solution of recursive domain equations","author":"Smyth","year":"1977","journal-title":"Proc. 18th IEEE FOCS"},{"key":"10.1016\/0304-3975(83)90098-1_BIB31","series-title":"Proc. 1st Internat. Coll. on Category Theory Applied to Computation and Control","first-page":"214","article-title":"On the recursive specification of data types","volume":"25","author":"Wand","year":"1975"},{"key":"10.1016\/0304-3975(83)90098-1_BIB32","series-title":"Tech. Rept. No. 23","article-title":"Fixed point constructions in order-enriched categories","author":"Wand","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:55:26Z","timestamp":1555077326000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900981"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90098-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}