{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T16:44:58Z","timestamp":1761929098750},"reference-count":32,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90036-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"263-295","source":"Crossref","is-referenced-by-count":12,"title":["Some fundamental algebraic tools for the semantics of computation"],"prefix":"10.1016","volume":"31","author":[{"given":"J.A.","family":"Goguen","sequence":"first","affiliation":[]},{"given":"R.M.","family":"Burstall","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90036-7_BIB1","article-title":"A junction between computer science and category theory, 1: Basic concepts and examples, Part 1","author":"Goguen","year":"1973"},{"key":"10.1016\/0304-3975(84)90036-7_BIB2","first-page":"147","article-title":"Rational algebraic theories and fixed-point solutions","author":"Wright","year":"1976","journal-title":"Proc. IEEE 17th Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(84)90036-7_BIB3","series-title":"Current Trends in Programming Methodology Vol. 3: Data Structuring","article-title":"An initial approach to the specification, correctness and implementation of abstractdata types","author":"Goguen","year":"1977"},{"key":"10.1016\/0304-3975(84)90036-7_BIB4","series-title":"Th\u00e8se, Fac. Sci.","first-page":"1","article-title":"Structures algebriques dans les categories","author":"Benabou","year":"1966"},{"key":"10.1016\/0304-3975(84)90036-7_BIB5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","article-title":"Heterogeneous algebras","volume":"8","author":"Birkhoff","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0304-3975(84)90036-7_BIB6","series-title":"A Computational Logic","author":"Boyer","year":"1980"},{"key":"10.1016\/0304-3975(84)90036-7_BIB7","first-page":"23","article-title":"Some techniques for proving correctness of programs which alter data structures","volume":"7","author":"Burstall","year":"1972"},{"key":"10.1016\/0304-3975(84)90036-7_BIB8","first-page":"1045","article-title":"Putting theories together to make specifications","author":"Burstall","year":"1977"},{"key":"10.1016\/0304-3975(84)90036-7_BIB9","series-title":"Symp. on Algebra and Applications","article-title":"Semantics of CLEAR","author":"Burstall","year":"1978"},{"key":"10.1016\/0304-3975(84)90036-7_BIB10","series-title":"Proc. 1979 Copenhagen Winter School on Abstract Software Specifications","first-page":"292","article-title":"The semantics of CLEAR, a specification language","volume":"84","author":"Burstall","year":"1980"},{"key":"10.1016\/0304-3975(84)90036-7_BIB11","series-title":"The Correctness Problem in Computer Science","article-title":"An informal introduction to CLEAR, a specification language","author":"Burstall","year":"1981"},{"key":"10.1016\/0304-3975(84)90036-7_BIB12","series-title":"Tech. Rept.","article-title":"Signatures, presentations and theories: A monad approach","author":"Burstall","year":"1980"},{"key":"10.1016\/0304-3975(84)90036-7_BIB13","article-title":"Parametric specification of abstract data types, parameter substitution and graph replacements","author":"Ehrich","year":"1978"},{"key":"10.1016\/0304-3975(84)90036-7_BIB14","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08860-1_16","article-title":"Stepwise specification and implementation of abstract data types","author":"Ehrig","year":"1978","journal-title":"Proc. 5th Internat. Conf. on Automata Languages and Programming"},{"key":"10.1016\/0304-3975(84)90036-7_BIB15","series-title":"IBM Res. Rept. RC 4564","first-page":"175","article-title":"Monadic computations and iterative algebraic theories","author":"Elgot","year":"1973"},{"key":"10.1016\/0304-3975(84)90036-7_BIB16","series-title":"Proc. IFIP Working Conf. on Formal Description of Programming Concepts","first-page":"21.1","article-title":"Abstract errors for abstract data types","author":"Goguen","year":"1977"},{"key":"10.1016\/0304-3975(84)90036-7_BIB17","article-title":"Order sorted algebras","volume":"14","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(84)90036-7_BIB18","series-title":"Proc. 5th Conf. on Automated Deduction","first-page":"356","article-title":"How to prove algebraic inductive hypotheses without induction: With applications to the correctness of data type representations","volume":"87","author":"Goguen","year":"1980"},{"key":"10.1016\/0304-3975(84)90036-7_BIB19","series-title":"Category Theory","author":"Herrlich","year":"1973"},{"key":"10.1016\/0304-3975(84)90036-7_BIB20","doi-asserted-by":"crossref","first-page":"563","DOI":"10.4153\/CJM-1957-064-6","article-title":"Some remarks concerning categories and subspaces","volume":"9","author":"Isbell","year":"1957","journal-title":"Canad. J. Math."},{"key":"10.1016\/0304-3975(84)90036-7_BIB21","series-title":"Model Theory and Topoi","first-page":"15","article-title":"Abstract Horn theories","author":"Keane","year":"1975"},{"key":"10.1016\/0304-3975(84)90036-7_BIB22","series-title":"Category Seminar","first-page":"75","article-title":"Review of the elements of 2-categories","volume":"20","author":"Kelly","year":"1974"},{"key":"10.1016\/0304-3975(84)90036-7_BIB23","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1073\/pnas.50.5.869","article-title":"Functional semantics of algebraic theories","volume":"50","author":"Lawvere","year":"1963","journal-title":"Proc. National Academy of Science"},{"key":"10.1016\/0304-3975(84)90036-7_BIB24","series-title":"Ph.D. Thesis","article-title":"Data types with sharing and circularity","author":"Levy","year":"1978"},{"key":"10.1016\/0304-3975(84)90036-7_BIB25","series-title":"Graduate Texts in Mathematics","article-title":"Categories for the Working Mathematician","author":"MacLane","year":"1971"},{"key":"10.1016\/0304-3975(84)90036-7_BIB26","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/954627.954630","article-title":"Limits of the algebraic specification of data types","volume":"12","author":"Majster","year":"1977","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(84)90036-7_BIB27","series-title":"Graduate Texts in Mathematics","article-title":"Algebraic Theories","author":"Manes","year":"1976"},{"key":"10.1016\/0304-3975(84)90036-7_BIB28","series-title":"Proc. Mathematical Foundations of Computer Science","first-page":"294","article-title":"On order-complete universal algebra and enriched functorial semantics","volume":"56","author":"Meseguer","year":"1977"},{"key":"10.1016\/0304-3975(84)90036-7_BIB29","series-title":"Proc. 7th ACM Symp. on Principles of Programming Languages","article-title":"On proving inductive properties of abstract data types","author":"Musser","year":"1980"},{"key":"10.1016\/0304-3975(84)90036-7_BIB30","series-title":"Repts. Midwest Category Seminar 5","first-page":"123","article-title":"The double category of adjoint squares","volume":"195","author":"Palmquist","year":"1971"},{"key":"10.1016\/0304-3975(84)90036-7_BIB31","series-title":"Ph.D. Thesis","article-title":"Higher order data types","author":"Parsaye-Ghomi","year":"1981"},{"key":"10.1016\/0304-3975(84)90036-7_BIB32","article-title":"Data type specification: Parameterization and the power of specification techniques","author":"Thatcher","year":"1978","journal-title":"Proc. 10th SIGACT Ann. Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900367?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900367?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:51:10Z","timestamp":1555113070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584900367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584900367"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90036-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}