{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:32:37Z","timestamp":1649035957106},"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)90034-5","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"254-266","source":"Crossref","is-referenced-by-count":4,"title":["Monadic recursion schemes: The effect of constants"],"prefix":"10.1016","volume":"18","author":[{"given":"Emily P.","family":"Friedman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheila A.","family":"Greibach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90034-5_BIB1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/321765.321780","article-title":"Decidable properties of monadic functional schemes","volume":"20","author":"Ashcroft","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(79)90034-5_BIB2","article-title":"On the Properties and Applications of Program Schemes","author":"Chandra","year":"1973"},{"key":"10.1016\/0022-0000(79)90034-5_BIB3","series-title":"A theory of programs","author":"De Baxxer","year":"1969"},{"key":"10.1016\/0022-0000(79)90034-5_BIB4","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/S0022-0000(77)80019-6","article-title":"Equivalence problems for deterministic context-free languages and monadic recursion schemes","volume":"14","author":"Frmdman","year":"1977","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0022-0000(79)90034-5_BIB5","series-title":"Proc. 14th Annual Symp. Com. on Switching and Automata Theory","first-page":"26","article-title":"Equivalence problems in monadic recursion schemes","author":"Friedman","year":"1973"},{"key":"10.1016\/0022-0000(79)90034-5_BIB6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(76)90074-8","article-title":"The inclusion problem for simple languages","volume":"1","author":"Friedman","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(79)90034-5_BIB7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01768465","article-title":"Simple context-free languages and free monadic recursion schemes","volume":"11","author":"Friedman","year":"1977","journal-title":"Math. System Theory"},{"key":"10.1016\/0022-0000(79)90034-5_BIB8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0019-9958(75)90175-8","article-title":"Functional schemes with nested predicates","volume":"27","author":"Gaul","year":"1975","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(79)90034-5_BIB9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(73)80040-6","article-title":"Program schemes, recursion schemes, and formal languages","volume":"12","author":"Garland","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90034-5_BIB10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","article-title":"One-way stack automata","volume":"14","author":"Ginmurg","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(79)90034-5_BIB11","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","article-title":"A new normal form theorem for context-free phrase structure grammars","volume":"12","author":"Greibach","year":"1965","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(79)90034-5_BIB12","series-title":"Theory of Program Structures: Schemes, Semantics, Verification","author":"Greibach","year":"1975"},{"key":"10.1016\/0022-0000(79)90034-5_BIB13","first-page":"82","article-title":"The logical schemas of algorithms","volume":"1","author":"Ianov","year":"1960","journal-title":"Prob. Kiberneto"},{"key":"10.1016\/0022-0000(79)90034-5_BIB14","series-title":"IEEE Conf. Rec. 7th Annu. Symp. on Switching and Automata Theory","first-page":"36","article-title":"Simple deterministic languages","author":"Korenjax","year":"1966"},{"key":"10.1016\/0022-0000(79)90034-5_BIB15","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0022-0000(70)80022-8","article-title":"On formalized computer programs","volume":"4","author":"Luckham","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90034-5_BIB16","series-title":"Computer Programming and Formal Systems","article-title":"A basis for a mathematical theory of computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/0022-0000(79)90034-5_BIB17","series-title":"Information Processing: Proc. IFIP Congress","first-page":"21","article-title":"Towards a mathematical science of computation","author":"McCarthy","year":"1962"},{"key":"10.1016\/0022-0000(79)90034-5_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321203.321204","article-title":"On Ianov's program schemata","volume":"11","author":"Rutledge","year":"1964","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:20:39Z","timestamp":1550319639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["0022000079900345"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90034-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}