{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:00Z","timestamp":1720201080180},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90058-1","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"33-50","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["On context-free trees"],"prefix":"10.1016","volume":"41","author":[{"given":"Virgil Emil","family":"C\u01cez\u01cenescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90058-1_BIB1","article-title":"Again on advice on structuring compilers and proving them correct","volume":"75","author":"C\u01cez\u01cenescu","year":"1982"},{"key":"10.1016\/0304-3975(85)90058-1_BIB2","series-title":"Proc. Logic Colloquium","first-page":"175","article-title":"Monadic computation and iterative algebraic theories","author":"Elgot","year":"1975"},{"key":"10.1016\/0304-3975(85)90058-1_BIB3","first-page":"183","article-title":"Identities in iterative and rational algebraic theories","volume":"XIV","author":"\u00c9sik","year":"1980","journal-title":"Comput. Linguistics and Comput. Languages"},{"key":"10.1016\/0304-3975(85)90058-1_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\/0304-3975(85)90058-1_BIB5","article-title":"Algebraic Semantics","volume":"99","author":"Guessarian","year":"1981"},{"key":"10.1016\/0304-3975(85)90058-1_BIB6","article-title":"On the interpretation of polyadic recursive program schemes","volume":"XV","author":"Nivat","year":"1975"},{"key":"10.1016\/0304-3975(85)90058-1_BIB7","series-title":"Foundations of Computer Science III, Part 2","first-page":"83","article-title":"Notes on algebraic fundamentals for theoretical computer science","volume":"109","author":"Thatcher","year":"1979"},{"key":"10.1016\/0304-3975(85)90058-1_BIB8","article-title":"Free continuous theories","author":"Wagner","year":"1977","journal-title":"IBM Res. Rept. RC 6906"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900581?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900581?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:21Z","timestamp":1553201601000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":8,"alternative-id":["0304397585900581"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90058-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}