{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:22:11Z","timestamp":1767903731426,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":11520,"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":[[1982]]},"DOI":"10.1016\/0304-3975(82)90024-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"235-257","source":"Crossref","is-referenced-by-count":33,"title":["Attribute grammars and recursive program schemes II"],"prefix":"10.1016","volume":"17","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[]},{"given":"Paul","family":"Franchi-Zannettacci","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90024-X_BIB1","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. Combinatorial Theory"},{"key":"10.1016\/0304-3975(82)90024-X_BIB2","series-title":"Contributions to compiler correctness","author":"Chirica","year":"1976"},{"key":"10.1016\/0304-3975(82)90024-X_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01744285","article-title":"An order-algebraic definition of Knuthian semantics","volume":"13","author":"Chirica","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90024-X_BIB4","series-title":"Report AAI-8018","article-title":"An axiomatic approach to the Korenjak-Hopcroft algorithms","author":"Courcelle","year":"1980"},{"key":"10.1016\/0304-3975(82)90024-X_BIB5","series-title":"Report AAI-8026","article-title":"On the equivalence problem for attribute systems","author":"Courcelle","year":"1980"},{"key":"10.1016\/0304-3975(82)90024-X_BIB6","series-title":"Formal Description of Programming Concepts","article-title":"Higher type recursion and self-application as control structures","author":"Damm","year":"1978"},{"key":"10.1016\/0304-3975(82)90024-X_BIB7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(77)90309-6","article-title":"I0-Macrolanguages and attributed translations","volume":"35","author":"Duske","year":"1977","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90024-X_BIB8","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","article-title":"Bottom-up and top-down tree transformations\u2014a comparison","volume":"9","author":"Engelfriet","year":"1975","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90024-X_BIB9","first-page":"241","article-title":"Some open questions and recent results on tree transducers and tree languages","author":"Engelfriet","year":"1980"},{"key":"10.1016\/0304-3975(82)90024-X_BIB10","series-title":"Memo 286","article-title":"The formal power of one-visit attribute grammars","author":"Engelfriet","year":"1979"},{"key":"10.1016\/0304-3975(82)90024-X_BIB11","series-title":"Fundamentals of Computation Theory 1979","article-title":"On functional tree-transducers","author":"Esik","year":"1979"},{"key":"10.1016\/0304-3975(82)90024-X_BIB12","series-title":"FOLDS, a declarative formal language definition system","author":"Fang","year":"1972"},{"key":"10.1016\/0304-3975(82)90024-X_BIB13","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. ACM"},{"key":"10.1016\/0304-3975(82)90024-X_BIB14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(79)90024-0","article-title":"On equivalence of grammars through transformation trees","volume":"9","author":"Harrison","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90024-X_BIB15","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90024-X_BIB16","article-title":"Call by need computations in non-ambiguous linear term rewriting systems","author":"Huet","year":"1979","journal-title":"Laboria Report 359"},{"key":"10.1016\/0304-3975(82)90024-X_BIB17","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1145\/361227.361231","article-title":"The intrinsically exponential complexity of the circularity problem for attribute grammars","volume":"18","author":"Jazayeri","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(82)90024-X_BIB18","series-title":"Report DAIMI-PB-107","article-title":"Circularity testing of attribute grammars requires exponential time: a simpler proof","author":"Jones","year":"1980"},{"key":"10.1016\/0304-3975(82)90024-X_BIB19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00288644","article-title":"Ordered attribute grammars","volume":"13","author":"Kastens","year":"1980","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90024-X_BIB20","first-page":"32","author":"Kennedy","year":"1976","journal-title":"Automatic generation of efficient evaluators for attribute grammars"},{"key":"10.1016\/0304-3975(82)90024-X_BIB21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","article-title":"Semantics of context-free languages","volume":"2","author":"Knuth","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90024-X_BIB22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01702865","article-title":"Semantics of context-free languages; correction","volume":"5","author":"Knuth","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90024-X_BIB23","series-title":"Th\u00e9se d'Etat","article-title":"De la d\u00e9finition \u00e1 la traduction des langages de programmation: m\u00e9thode des attributs s\u00e9mantiques","author":"Lorho","year":"1974"},{"key":"10.1016\/0304-3975(82)90024-X_BIB24","series-title":"Proving and Improving Programs","first-page":"29","article-title":"Algorithms for checking consistency of attribute grammars","author":"Lorho","year":"1975"},{"key":"10.1016\/0304-3975(82)90024-X_BIB25","series-title":"Report DAIMI-PB-90","article-title":"attribute grammars and mathematical semantics","author":"Mayoh","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290024X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290024X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:55:01Z","timestamp":1555062901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758290024X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982]]}},"alternative-id":["030439758290024X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90024-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}