{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:06:15Z","timestamp":1761674775795},"reference-count":68,"publisher":"Elsevier BV","issue":"1-2","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)90134-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"175-209","source":"Crossref","is-referenced-by-count":35,"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)90134-8_BIB1","series-title":"IBM Res. Rept. RC 4526","article-title":"A junction between computer science and category theory, I: Basic concepts and examples","author":"Goguen","year":"1973"},{"key":"10.1016\/0304-3975(84)90134-8_BIB2","series-title":"IBM Res. Rept. RC 5369","article-title":"An introduction to categories, Algebraic theories and algebras","author":"Goguen","year":"1975"},{"key":"10.1016\/0304-3975(84)90134-8_BIB3","first-page":"89","article-title":"Abstract data types as initial algebras and correctness of data representations","author":"Goguen","year":"1975","journal-title":"Proc. Conf. on Computer Graphics, Pattern Recognition and Data Structure"},{"key":"10.1016\/0304-3975(84)90134-8_BIB4","first-page":"153","article-title":"Some fundamentals of order-algebraic semantics","volume":"45","author":"Wagner","year":"1976"},{"key":"10.1016\/0304-3975(84)90134-8_BIB5","series-title":"Proc. IEEE 17th Symp. on Foundations of Computer Science","first-page":"147","article-title":"Rational algebraic theories and fixed-point solutions","author":"Wright","year":"1976"},{"key":"10.1016\/0304-3975(84)90134-8_BIB6","series-title":"IBM Res. Rept. RC 6908","article-title":"A junction between computer science and category theory, I: Basic concepts and examples","author":"Goguen","year":"1976"},{"issue":"1","key":"10.1016\/0304-3975(84)90134-8_BIB7","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\/0304-3975(84)90134-8_BIB8","series-title":"Current Trends in Programming Methodology Vol. 3: Data Structuring","article-title":"An initial approach to the specification, correctness and implementation of abstract data types","author":"Goguen","year":"1977"},{"key":"10.1016\/0304-3975(84)90134-8_BIB9","series-title":"Arrows, Structures and Functors","author":"Arbib","year":"1975"},{"key":"10.1016\/0304-3975(84)90134-8_BIB10","series-title":"Th\u00e8se","first-page":"1","article-title":"Structures Algebriques dans les Categories","author":"Benabou","year":"1966"},{"key":"10.1016\/0304-3975(84)90134-8_BIB11","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)90134-8_BIB12","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-0000(76)80030-X","article-title":"Varieties of ordered algebras","volume":"13","author":"Bloom","year":"1976","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(84)90134-8_BIB13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/321864.321875","article-title":"Proving theorems about LISP functions","volume":"22","author":"Boyer","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(84)90134-8_BIB14","series-title":"A Computational Logic","author":"Boyer","year":"1980"},{"key":"10.1016\/0304-3975(84)90134-8_BIB15","first-page":"23","article-title":"Some techniques for proving correctness of programs which after data structures","volume":"Vol. 7","author":"Burstall","year":"1972"},{"key":"10.1016\/0304-3975(84)90134-8_BIB16","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(84)90134-8_BIB17","series-title":"Symp. on Algebra and Applications","article-title":"Semantics of spCLEAR","author":"Burstall","year":"1978"},{"key":"10.1016\/0304-3975(84)90134-8_BIB18","first-page":"292","article-title":"The Semantics of spCLEAR, a specification language","volume":"86","author":"Burstall","year":"1980"},{"key":"10.1016\/0304-3975(84)90134-8_BIB19","series-title":"The Correctness Problem in Computer Science","article-title":"An informal introduction to spCLEAR, a specification language","author":"Burstall","year":"1981"},{"key":"10.1016\/0304-3975(84)90134-8_BIB20","series-title":"Tech. Rept.","article-title":"Signatures, presentations and theories: A monad approach","author":"Burstall","year":"1980"},{"key":"10.1016\/0304-3975(84)90134-8_BIB21","series-title":"Proc. 1st Internat. Symp: Category Theory Applied to Computation and Control","article-title":"The algebraic theory of recursive program schemes","year":"1974"},{"key":"10.1016\/0304-3975(84)90134-8_BIB22","series-title":"Proc. Workshop \u2018Graphentheoretische Konsepte in der Informatik\u2019","article-title":"Parametric specification of abstract data types, parameter substitution and graph replacements","author":"Ehrich","year":"1978"},{"key":"10.1016\/0304-3975(84)90134-8_BIB23","series-title":"Proc. Mathematical Foundations of Computer Science, Zakopane, Poland","article-title":"Deriving structures from structures","author":"Ehrig","year":"1978"},{"key":"10.1016\/0304-3975(84)90134-8_BIB24","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)90134-8_BIB25","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/S0019-9958(67)90670-5","article-title":"Automata in general algebras","volume":"11","author":"Eilenberg","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(84)90134-8_BIB26","series-title":"Symp. on Semantics of Algorithm Languages","first-page":"71","article-title":"Algebraic theories and program schemes","author":"Elgot","year":"1971"},{"key":"10.1016\/0304-3975(84)90134-8_BIB27","series-title":"IBM Res. Rept. RC 4564","article-title":"Monadic computations and iterative algebraic theories","author":"Elgot","year":"1973"},{"key":"10.1016\/0304-3975(84)90134-8_BIB28","article-title":"A concrete introduction to algebraic automata theory","volume":"44","author":"Ginali","year":"1975"},{"key":"10.1016\/0304-3975(84)90134-8_BIB29","series-title":"Ph.D. Dissertation","article-title":"Iterative algebraic theories, infinite trees and program schemata","author":"Ginali","year":"1976"},{"key":"10.1016\/0304-3975(84)90134-8_BIB30","series-title":"Global Systems Dynamics","first-page":"112","article-title":"Mathematical representation of hierarchically organized systems","author":"Goguen","year":"1971"},{"key":"10.1016\/0304-3975(84)90134-8_BIB31","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/SWAT.1972.10","article-title":"On homomorphism, simulation, correctness and subroutines for programs and program schemes","author":"Goguen","year":"1972","journal-title":"Proc. 13th IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(84)90134-8_BIB32","first-page":"151","article-title":"Semantics of computation","volume":"25","author":"Goguen","year":"1975"},{"key":"10.1016\/0304-3975(84)90134-8_BIB33","series-title":"Proc. Symp. on Mathematical Systems Theory","first-page":"352","article-title":"Correctness and equivalence of data types","author":"Goguen","year":"1976"},{"key":"10.1016\/0304-3975(84)90134-8_BIB34","series-title":"Proc. IFIP Working Conference 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)90134-8_BIB35","article-title":"Order sorted algebras","volume":"14","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(84)90134-8_BIB36","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)90134-8_BIB37","series-title":"Proc. Conf. on Mathematical Foundations of Computer Science","first-page":"584","article-title":"Correctness of recursive non-deterministic flow diagram programs","author":"Goguen","year":"1977"},{"issue":"7","key":"10.1016\/0304-3975(84)90134-8_BIB38_1","first-page":"24","article-title":"Completeness of many-sorted equational logic","volume":"16","author":"Goguen","year":"1981","journal-title":"SIGACT Newsletter"},{"issue":"1","key":"10.1016\/0304-3975(84)90134-8_BIB38_2","first-page":"9","article-title":"Completeness of many-sorted equational logic","volume":"17","author":"Goguen","year":"1982","journal-title":"SIGACT Newsletter"},{"key":"10.1016\/0304-3975(84)90134-8_BIB39","series-title":"Topic: The Categorial Analysis of Logic","author":"Goldblatt","year":"1979"},{"key":"10.1016\/0304-3975(84)90134-8_BIB40","series-title":"Ph.D. Thesis","article-title":"The specification and application to programming of abstract data types","author":"Guttag","year":"1975"},{"key":"10.1016\/0304-3975(84)90134-8_BIB41","first-page":"1048","article-title":"Abstract data types and software validation","volume":"21","author":"Guttag","year":"1978","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(84)90134-8_BIB42","series-title":"Category Theory","author":"Herrlich","year":"1973"},{"key":"10.1016\/0304-3975(84)90134-8_BIB43","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/mana.19630270108","article-title":"Algebras with a scheme of operators","volume":"27","author":"Huggins","year":"1963","journal-title":"Mathematische Nachrachten"},{"issue":"2","key":"10.1016\/0304-3975(84)90134-8_BIB44","first-page":"239","article-title":"Proofs by induction in equational theories with constructors","volume":"25","author":"Heut","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(84)90134-8_BIB45","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)90134-8_BIB46","series-title":"Model Theory and Topoi","first-page":"15","article-title":"Abstract horn theories","author":"Keane","year":"1975"},{"key":"10.1016\/0304-3975(84)90134-8_BIB47","series-title":"Computational Problems in Abstract Algebras","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(84)90134-8_BIB48","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1017\/S0004972700010431","article-title":"Primitive recursive algebraic theories and program schemes","volume":"17","author":"K\u00fchnel","year":"1977","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0304-3975(84)90134-8_BIB49","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)90134-8_BIB50","series-title":"Graduate Texts in Mathematics","article-title":"Categories for the working mathematician","author":"MacLane","year":"1971"},{"key":"10.1016\/0304-3975(84)90134-8_BIB51","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)90134-8_BIB52","series-title":"Graduate Texts in Mathematics","article-title":"Algebraic theories","author":"Manes","year":"1976"},{"key":"10.1016\/0304-3975(84)90134-8_BIB53","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)90134-8_BIB54","article-title":"Making denotational semantics less concrete","author":"Mosses","year":"1977","journal-title":"Proc. Bad Honnef Workshop on Semantics of Programming Languages"},{"key":"10.1016\/0304-3975(84)90134-8_BIB55","series-title":"Tech. Rept.","article-title":"Modular denotational semantics","author":"Mosses","year":"1979"},{"key":"10.1016\/0304-3975(84)90134-8_BIB56","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)90134-8_BIB57","series-title":"Ph.D. Thesis","article-title":"Higher order data types","author":"Parsaye-Ghomi","year":"1981"},{"issue":"3","key":"10.1016\/0304-3975(84)90134-8_BIB58","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/322017.322028","article-title":"Semantics of the domain of flow diagrams","volume":"24","author":"Reynolds","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(84)90134-8_BIB59","series-title":"Tech. Rept.","article-title":"Category sorted algebras","author":"Reynolds","year":"1978"},{"key":"10.1016\/0304-3975(84)90134-8_BIB60","first-page":"504","article-title":"Initially-restricting algebraic theories","volume":"88","author":"Reichel","year":"1980"},{"key":"10.1016\/0304-3975(84)90134-8_BIB61","series-title":"Tech. Rept.","article-title":"The induce of a theory: A construction using monadic theories","author":"Rydeheard","year":"1979"},{"key":"10.1016\/0304-3975(84)90134-8_BIB62","series-title":"Specification of abstract data types using conditional axioms","author":"Thatcher","year":"1977"},{"key":"10.1016\/0304-3975(84)90134-8_BIB63","article-title":"Data type specification: Parameterization and the power of specification techniques","author":"Thatcher","year":"1978","journal-title":"Proc. 10th SIGACT Annual Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(84)90134-8_BIB64","doi-asserted-by":"crossref","DOI":"10.1109\/SWAT.1971.16","article-title":"Languages for defining sets in arbitrary algebras","author":"Wagner","year":"1971","journal-title":"Proc. 12th IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(84)90134-8_BIB65","series-title":"Proc. 3rd Ann. ACM Symp. on Theory of Computing","article-title":"An algebraic theory of recursive definitions and recursive languages","author":"Wagner","year":"1971"},{"key":"10.1016\/0304-3975(84)90134-8_BIB66","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","article-title":"Final algebra semantics and data type extensions","volume":"19","author":"Wand","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(84)90134-8_BIB67","article-title":"Algebraic specification of data types","volume":"119","author":"Zilles","year":"1974"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901348?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901348?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:00Z","timestamp":1555127460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584901348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":68,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584901348"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90134-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}