{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T06:27:16Z","timestamp":1672381636389},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90142-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"135-173","source":"Crossref","is-referenced-by-count":2,"title":["Recursion induction principle revisited"],"prefix":"10.1016","volume":"22","author":[{"given":"G\u00e9rard","family":"Boudol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Kott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0304-3975(83)90142-1_BIB1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous semantics","volume":"24","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90142-1_BIB2","series-title":"Recursive procedures","author":"de Bakker","year":"1971"},{"key":"10.1016\/0304-3975(83)90142-1_BIB3","article-title":"A theory of programs","author":"de Bakker","year":"1971","journal-title":"IBM Seminar"},{"key":"10.1016\/0304-3975(83)90142-1_BIB4","series-title":"Proc. 4th GI","first-page":"79","article-title":"A new recursion induction principle","volume":"67","author":"Boudol","year":"1979"},{"key":"10.1016\/0304-3975(83)90142-1_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","article-title":"Proving properties of programs by structural induction","volume":"12","author":"Burstall","year":"1969","journal-title":"Comput. J."},{"issue":"1","key":"10.1016\/0304-3975(83)90142-1_BIB6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90142-1_BIB7","article-title":"Recursive definition of partial functions and their computations","author":"Cadiou","year":"1972","journal-title":"Ph.D. Thesis"},{"issue":"3","key":"10.1016\/0304-3975(83)90142-1_BIB8_1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(78)90008-7","article-title":"A representation of trees by languages","volume":"6","author":"Courcelle","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0304-3975(83)90142-1_BIB8_2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(78)90039-7","article-title":"A representation of trees by languages","volume":"7","author":"Courcelle","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90142-1_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01744293","article-title":"Infinite trees in normal form and recursive equations having a unique solution","volume":"13","author":"Courcelle","year":"1979","journal-title":"Math. System Theory"},{"key":"10.1016\/0304-3975(83)90142-1_BIB10","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0022-0000(78)90016-8","article-title":"On some classes of interpretations","volume":"17","author":"Courcelle","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90142-1_BIB11","series-title":"Proc. MFCS 78","first-page":"16","article-title":"The algebraic semantics of recursive program schemes","volume":"64","author":"Courcelle","year":"1978"},{"key":"10.1016\/0304-3975(83)90142-1_BIB12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0022-0000(76)80036-0","article-title":"Completeness results of the equivalence of recursive program schemes","volume":"11","author":"Courcelle","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90142-1_BIB13","doi-asserted-by":"crossref","DOI":"10.1137\/0205031","article-title":"Correct computation rules for recursive languages","volume":"5","author":"Downey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90142-1_BIB14","series-title":"M.Sc. Thesis","article-title":"Induction in proofs about program","author":"Greif","year":"1972"},{"key":"10.1016\/0304-3975(83)90142-1_BIB15","article-title":"Algebraic Semantics","volume":"99","author":"Guessarian","year":"1981"},{"key":"10.1016\/0304-3975(83)90142-1_BIB16","first-page":"189","article-title":"Semantic equivalence of program schemes and its syntactic characterization","author":"Guessarian","year":"1976","journal-title":"Proc. 3rd ICALP"},{"key":"10.1016\/0304-3975(83)90142-1_BIB17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","article-title":"Strict deterministic grammars","volume":"7","author":"Harrison","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90142-1_BIB18","first-page":"30","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","author":"Huet","year":"1977","journal-title":"Proc. 18th FOCS"},{"key":"10.1016\/0304-3975(83)90142-1_BIB19","author":"Huet","year":"1980","journal-title":"Proofs by induction in equational theories with constructors, preliminary paper"},{"key":"10.1016\/0304-3975(83)90142-1_BIB20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00264598","article-title":"Proving and applying program transformations expressed with 2nd order patterns","volume":"11","author":"Huet","year":"1978","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(83)90142-1_BIB21","series-title":"Formal Language Theory Perspectives and Open Problems","article-title":"Equations and rewrite rules. A survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(83)90142-1_BIB22","series-title":"Program Transformations","first-page":"232","article-title":"About transformation system: a theoretical study","author":"Kott","year":"1978"},{"key":"10.1016\/0304-3975(83)90142-1_BIB23","article-title":"Des substitutions dans les syst\u00e8mes d`\u00e9quations alg\u00e9briquis. Application aux transformations de programme et \u00e0 leur correction","author":"Kott","year":"1979","journal-title":"Doctoral Thesis"},{"key":"10.1016\/0304-3975(83)90142-1_BIB24","article-title":"A system for proving equivalence of recursive programs","author":"Kott","year":"1980","journal-title":"Proc. 5th Colloquium on Automated Deduction"},{"key":"10.1016\/0304-3975(83)90142-1_BIB25","series-title":"Computer Programming and Formal Systems","article-title":"A basis for a mathematical theory of computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/0304-3975(83)90142-1_BIB26","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"issue":"5","key":"10.1016\/0304-3975(83)90142-1_BIB27","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/362588.362598","article-title":"Another recursion induction principle","volume":"14","author":"Morris","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(83)90142-1_BIB28","first-page":"255","article-title":"On the interpretation of recursive polyadic program scheme","volume":"XV","author":"Nivat","year":"1975","journal-title":"Instituto Nazionale di Alta Matematica, Symposia Matematica"},{"issue":"1","key":"10.1016\/0304-3975(83)90142-1_BIB29","first-page":"9","article-title":"Interpr\u00e9tation universelle d'un sch\u00e9ma de programme r\u00e9cursif","volume":"7","author":"Nivat","year":"1977","journal-title":"Informatica"},{"key":"10.1016\/0304-3975(83)90142-1_BIB30","first-page":"59","article-title":"Fixpoint induction and proofs of program properties","volume":"5","author":"Park","year":"1970"},{"key":"10.1016\/0304-3975(83)90142-1_BIB31","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/S0022-0000(75)80057-2","article-title":"Program equivalence and context-free grammars","volume":"11","author":"Rosen","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90142-1_BIB32","first-page":"109","article-title":"Tree oriented proofs of some theorems on context-free languages and indexed languages","author":"Rounds","year":"1970","journal-title":"Proc. 2nd STOC"},{"key":"10.1016\/0304-3975(83)90142-1_BIB33","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","article-title":"Pushdown automata and context-free languages","volume":"6","author":"Sch\u00fctzenberger","year":"1963","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(83)90142-1_BIB34","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/S0022-0000(74)80048-6","article-title":"Correct and optimal implementation of recursion in a simple programming language","volume":"9","author":"Vuillemin","year":"1974","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901421?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:27:32Z","timestamp":1555126052000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583901421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583901421"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90142-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}