{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:46:27Z","timestamp":1762458387324},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"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":12465,"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":[[1979,6]]},"DOI":"10.1016\/0022-0000(79)90032-1","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T06:41:56Z","timestamp":1070606516000},"page":"228-242","source":"Crossref","is-referenced-by-count":52,"title":["Regular trees and the free iterative theory"],"prefix":"10.1016","volume":"18","author":[{"given":"Susanna","family":"Ginali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90032-1_BIB1","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(79)90032-1_BIB2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0022-0000(77)80015-9","article-title":"Scalar and vector iteration","volume":"14","author":"Bloom","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90032-1_BIB3","series-title":"Proc. of the Int. Joint Conf. on Artificial Intelligence","article-title":"Putting theories together to make specifications","author":"Burstall","year":"1977"},{"key":"10.1016\/0022-0000(79)90032-1_BIB4","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. Contr."},{"key":"10.1016\/0022-0000(79)90032-1_BIB5","article-title":"Monadic computation and iterative algebraic theories","volume":"Vol. 80","author":"Elgot","year":"1975"},{"issue":"No. 1","key":"10.1016\/0022-0000(79)90032-1_BIB6","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1976.233800","article-title":"Structured programming with and without GO TO statements","volume":"SE-2","author":"Elgot","year":"1976","journal-title":"IEEE Trans. Softw. Eng."},{"article-title":"Iterative Algebraic Theories, Infinite Trees, and Program Schemata","year":"1976","author":"Ginali","key":"10.1016\/0022-0000(79)90032-1_BIB7"},{"article-title":"Abstract Errors and Abstract Data Types","year":"1977","author":"Goguen","key":"10.1016\/0022-0000(79)90032-1_BIB8"},{"key":"10.1016\/0022-0000(79)90032-1_BIB9","article-title":"A Junction between Computer Science and Category Theory; I. Basic Definitions and Examples","author":"Goguen","year":"1976","journal-title":"IBM Research Report RC 5908"},{"key":"10.1016\/0022-0000(79)90032-1_BIB10","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(79)90032-1_BIB11","article-title":"An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types","author":"Coguen","year":"1977","journal-title":"IBM Research Report RC 6487"},{"article-title":"The Specification and Application to Programming of Abstract Data Types","year":"1975","author":"Guttag","key":"10.1016\/0022-0000(79)90032-1_BIB12"},{"key":"10.1016\/0022-0000(79)90032-1_BIB13","first-page":"869","article-title":"Functional semantics of algebraic theories","volume":"50","author":"Lawvere","year":"1963"},{"article-title":"Categories for the Working Mathematician","year":"1971","author":"MacLane","key":"10.1016\/0022-0000(79)90032-1_BIB14"},{"key":"10.1016\/0022-0000(79)90032-1_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0059703","article-title":"Lattice of flow diagrams","author":"Scott","year":"1971"},{"article-title":"Mathematical Foundations of Language Theory","year":"1973","author":"Wand","key":"10.1016\/0022-0000(79)90032-1_BIB16"},{"article-title":"Algebraic Theories and Three Rewriting Systems","year":"1977","author":"Wand","key":"10.1016\/0022-0000(79)90032-1_BIB17"},{"article-title":"Algebraic Specification of Data Types","year":"1974","author":"Zilles","key":"10.1016\/0022-0000(79)90032-1_BIB18"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:20:40Z","timestamp":1550301640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["0022000079900321"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90032-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}