{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:56Z","timestamp":1725663296488},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540127277"},{"type":"electronic","value":"9783540387145"}],"license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12727-5_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:54:42Z","timestamp":1330192482000},"page":"191-204","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A class of program schemes based on tree rewriting systems"],"prefix":"10.1007","author":[{"given":"B.","family":"Courcelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Lavandier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01744293","volume":"13","author":"B. Courcelle","year":"1979","unstructured":"B. COURCELLE, Infinite trees in normal form and recursive equations having a unique solution. Math. Systems Theory 13 (1979), p.131\u2013180.","journal-title":"Math. Systems Theory"},{"key":"11_CR2","unstructured":"B. COURCELLE, Fundamental properties of infinite trees, Report AAI, no8202 (1982), Universit\u00e9 de Bordeaux I, to appear in Theor. Comput. Sci.1983."},{"key":"11_CR3","unstructured":"B. COURCELLE, An axiomatic approach to the Korenjak-Hopcroft algorithms; to appear Math. Systems Theory."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(82)90003-2","volume":"17","author":"B. Courcelle","year":"1982","unstructured":"B. COURCELLE, P. FRANCHI-ZANNETTACCI, Attribute grammars and recursive program schemes; Theor. Comput. Sci. 17 (1982), p.163\u2013191 and p.235\u2013257.","journal-title":"Theor. Comput. Sci."},{"key":"11_CR5","unstructured":"B. COURCELLE, F. LAVANDIER, D\u00e9finitions r\u00e9cursives par cas; Report AAI no8103 (1981), Universit\u00e9 de Bordeaux I, submitted for publication."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"B. COURCELLE, M. NIVAT, The algebraic semantics of recursive program schemes; MFCS'78, Lec. Notes Comput. Sci. 64, p.16\u201330.","DOI":"10.1007\/3-540-08921-7_53"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/S0022-0000(77)80019-6","volume":"14","author":"E. Friedman","year":"1977","unstructured":"E. FRIEDMAN, Equivalence problems for deterministic context-free languages and monadic recursion schemes, J. Comput. System Sci. 14 (1977), p.334\u2013359.","journal-title":"J. Comput. System Sci."},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(73)80040-6","volume":"7","author":"S. Garland","year":"1973","unstructured":"S. GARLAND, D. LUCKHAM, Program schemes, recursion schemes and formal languages, J. Comput. System Sci. 7 (1973), p.119\u2013160.","journal-title":"J. Comput. System Sci."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"J. GOGUEN, J. THATCHER, E. WAGNER, J. WRIGHT, Initial algebra semantics and continuous algebras, J. Assoc. Comput. Mach. 24 (1977), p.68\u201395.","journal-title":"J. Assoc. Comput. Mach."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"I. GUESSARIAN, Algebraic semantics, Lec. Notes Comput. Sci.99, Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10284-1"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. HUET, Confluent reductions, abstract properties and applications to term rewriting systems, J. Assoc. Comput. Mach.27 (1980), p.797\u2013821.","journal-title":"J. Assoc. Comput. Mach."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","volume":"25","author":"G. Huet","year":"1982","unstructured":"G. HUET, J.M. HULLOT, Proofs by induction in equational theories with constructors; J. Comput.System Sci. 25 (1982), p.239\u2013266.","journal-title":"J. Comput.System Sci."},{"key":"11_CR13","unstructured":"G. HUET, J.J. LEVY, Call by need computations in nonambiguous linear term rewriting systems; Laboria report 359, (1979)."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"G. HUET, D. OPPEN, Equations and rewrite rules, a survey. Proceedings of the International Symposium on Formal Languages Theory, Santa Barbara, California (December 10\u201314 1979), Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"11_CR15","unstructured":"F. LAVANDIER, Sur les syst\u00e8mes de d\u00e9finitions r\u00e9cursives par cas. Application \u00e0 la s\u00e9mantique d\u00e9notationnelle; Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 de Bordeaux I (1982)."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1137\/0205033","volume":"5","author":"Z. Manna","year":"1976","unstructured":"Z. MANNA, A. SHAMIR, The theoretical aspects of the optimal fixedpoint; SIAM J. on Comput. 5 (1976), p.414\u2013426.","journal-title":"SIAM J. on Comput."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/0210037","volume":"10","author":"B. Mayoh","year":"1981","unstructured":"B. MAYOH, Attribute grammars and mathematical semantics; SIAM J. on Comput. 10 (1981), p.503\u2013518.","journal-title":"SIAM J. on Comput."},{"key":"11_CR18","unstructured":"M. NIVAT, On the interpretation of polyadic recursive program schemes; Symposia Mathematica 15, Academic Press (1975), p.255\u2013281."},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1145\/322217.322229","volume":"27","author":"J. C. Raoult","year":"1980","unstructured":"J.C. RAOULT, J. VUILLEMIN, Operational and semantic equivalence between recursive programs, J. Assoc. Comput. Mach. 27 (1980), p. 772\u2013796.","journal-title":"J. Assoc. Comput. Mach."},{"key":"11_CR20","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B. Rosen","year":"1973","unstructured":"B. ROSEN, Tree manipulation systems and Church-Rosser theorems; J. Assoc. Comput. Mach. 20 (1973), p.160\u2013187.","journal-title":"J. Assoc. Comput. Mach."},{"key":"11_CR21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-94-009-7893-5_10","volume-title":"Semantic models, in Theoretical Foundations of Programming Methodology","author":"J. Stoy","year":"1982","unstructured":"J. STOY, Semantic models, in Theoretical Foundations of Programming Methodology; M. Broy and G. Schmidt eds., D. Reidel Pub. Co., Dordrecht, Holland 1982, p.293\u2013325."},{"key":"11_CR22","unstructured":"R. TENNENT, The denotational semantics of programming languages, Comm. of ACM 19-8 (1976), p.437\u2013453."},{"key":"11_CR23","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/S0022-0000(73)80032-7","volume":"7","author":"S. Walker","year":"1973","unstructured":"S. WALKER, H. STRONG, Characterizations of flow-chartable recursions; J. Comput. System Sci. 7 (1973), p.404\u2013447.","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","CAAP'83"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12727-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:50:54Z","timestamp":1558270254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12727-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540127277","9783540387145"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-12727-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}