{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:11Z","timestamp":1648598411061},"reference-count":29,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1984]]},"DOI":"10.1051\/ita\/1984180200911","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T10:41:34Z","timestamp":1486377694000},"page":"91-129","source":"Crossref","is-referenced-by-count":1,"title":["D\u00e9finitions r\u00e9cursives par cas"],"prefix":"10.1051","volume":"18","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":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BLOOM S. et TINDELL R., Varieties of if Then-else, Siam J. Comput. vol. 12, 1983, p. 677-707.7210070518.68010","DOI":"10.1137\/0212047"},{"key":"R2","unstructured":"2. BOUDOL G., Calculs maximaux et s\u00e9mantique op\u00e9rationnelle des programmes non d\u00e9terministes, Th\u00e8se doctorat, Universit\u00e9 de Paris-7, 1980."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. COURCELLE B., Infinite Trees in Normal Form and Recursive Equations having a Unique Solution, Math. Systems Theory, vol. 13, 1979, p. 131-180.5538790418.68013","DOI":"10.1007\/BF01744293"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. COURCELLE B., Fundamental Properties of Infinite Trees, Theor. Comput. Sc., vol. 25, 1984, p. 95-169.6930760521.68013","DOI":"10.1016\/0304-3975(83)90059-2"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. COURCELLE B., An Axiomatic Approach to the Korenjak-Hopcroft Algorithms, Math. Systems Theory, vol. 16, 1983, p. 191-231.7024480581.68032","DOI":"10.1007\/BF01744577"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. COURCELLE B. et FRANCHI-ZANNETTACCI P., Attribute Grammars and Recursive Program Schemes, Theor. Comput. Sc., vol. 17, 1982, p. 163-191 and p. 235-257.0481.68068","DOI":"10.1016\/0304-3975(82)90024-X"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. COURCELLE B. et LAVANDIER F., A Class of Program Schemes Based on Tree Rewriting Systems 8th C.A.A.P., L'Aquila, Lec. Notes Comp. Sc., Springer, vol.159, 1983, p. 191-2047442100518.68015","DOI":"10.1007\/3-540-12727-5_11"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. COURCELLE B., NIVAT M., The algebraic semantics of recursive program schemes: MFCS'78, Lec. Notes Comput. Sc., vol. 64, p. 16-30.5198270384.68016","DOI":"10.1007\/3-540-08921-7_53"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. DARLINGTON J., BURSTALL R., A System which Automatically Improves Program, Acta Informatica, vol. 6, 1976, p. 41-60.0323.68008","DOI":"10.1007\/BF00263742"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. FRIEDMAN E., Equivalence Problems for Deterministic Context-free Languages andMonadic Recursion Schemes, J. Comput. System Sc., 14, 1977, p. 334-359.4434450358.68109","DOI":"10.1016\/S0022-0000(77)80019-6"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. GARLAND S. et LUCKHAM D., Program Schemes, Recursion Schemes and Formal Languages, J. Comput. System Sc., vol.7, 1973, p. 119-160.3159300277.68010","DOI":"10.1016\/S0022-0000(73)80040-6"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. GOGUEN J., THATCHER J., WAGNER E. et WRIGHT J., Initial Algebra Semantics and Continuons Algebras, J. Assoc. Comput. Mach., vol. 24, 1977, p. 68-95.5207110359.68018","DOI":"10.1145\/321992.321997"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. GUESSARIAN I., Algebraic Semantics, Lec. Notes Comput. Sc., vol. 99, Springer-Verlag, 1981.6179080474.68010","DOI":"10.1007\/3-540-10284-1"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. HUET G., Confluent Reductions, Abstract Properties and Applications to Term Rewriting Systems, J. Assoc. Comput. Mach., vol. 27, 1980, p. 797-821.5947000458.68007","DOI":"10.1145\/322217.322230"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. HUET G. et HULLOT J. M., Proofs by induction in Equational Theories with Constructors, I. Compt. System Sc., Vol. 25, 1982, p. 239-266.6805190532.68041","DOI":"10.1016\/0022-0000(82)90006-X"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. HUET G. et LANG B., Proving and Applyind Program Transformations Expressed with 2nd Order Patterns, Acta Informatica, vol.11, 1978, p. 31-55.5147520389.68008","DOI":"10.1007\/BF00264598"},{"key":"R17","unstructured":"17. HUET G. et LEVY J. J., Call by Need Computations in Nonambigous Linear Term Rewriting System, Laboria report, vol. 359, 1979."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"18. HUET G. et OPPEN D., Equations and Rewrite Rules, a Survey, Proceedings of the International Symposium on Formal Languages Theory, Santa Barbara, California (December 10-14, 1979),","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"R19","unstructured":"19. LAVANDIER F., Sur les syst\u00e8mes de d\u00e9finitions r\u00e9cursives par cas. Application \u00e0 la s\u00e9mantique d\u00e9notationnelle, Th\u00e8se de 3e cycle, Universit\u00e9 de Bordeaux-I, 1982."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"20. MANNA Z., SHAMIR A., The Theoretical Aspects of the Optimal Fixedpoint, S.I.A.M., J. Comput., vol. 5, 1976, p. 414-426.4409950358.68017","DOI":"10.1137\/0205033"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"21. MAYOH B., Attribute Grammars and Mathematical Semantics; S.I.A.M. J. Comput., vol. 10, 1981, p. 503-518.6230620462.68062","DOI":"10.1137\/0210037"},{"key":"R22","unstructured":"22. NIVAT M., On the Interpretation of Polyadic Recursive Program Schemes, Symposia Mathematica, vol.15, Academic Press, 1975, p. 255-281.3915630346.68041"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"23. RAOULT J. C. et VUILLEMIN J., Operational and Semantic Equivalence between Recursive Programs, J. Assoc. Comput. Mach., vol. 27, 1980, p. 772-796.5946990447.68004","DOI":"10.1145\/322217.322229"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"24. ROSEN B., Tree Manipulation Systems and Church-Rosser Theorems, J. Assoc. Comput. Mach., vol. 20, 1973, p. 160-187.3318500267.68013","DOI":"10.1145\/321738.321750"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"25. STOY J., Semantic models, in Theoretical Foundations of Programming Methodology,BROY M. and SCHMIDT G., \u00e9d., D. Reidel Pub. Co., Dordrecht, Holland, 1982, p. 293-325.6969640513.68072","DOI":"10.1007\/978-94-009-7893-5_10"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"26. TENNENT R., The denotational Semantics of Programming Languages, Comm. of A.C.M., vol.19-8, 1976, p.437-453.4287710337.68010","DOI":"10.1145\/360303.360308"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"27. WALKER S. et STRONG H., Characterizations of Flow-chartable Recursions, J. Comput. System Sc., vol. 7, 1973, p. 404-447.3318540266.68011","DOI":"10.1016\/S0022-0000(73)80032-7"},{"key":"R28","unstructured":"28. ENGELFRIET J., Some Open Questions and Recent Results on Tree Transducers and Tree Languages, m\u00eame volume que [18]"},{"key":"R29","unstructured":"29. FRANCHI-ZANNETTACCI P., Attributs s\u00e9mantiques et sch\u00e9mas de programmes, Th\u00e8se d'\u00c9tat, Universit\u00e9 de Bordeaux-I, 1982."}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180200911\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:35:40Z","timestamp":1568784940000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180200911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":29,"journal-issue":{"issue":"2"},"alternative-id":["ita1984180200911"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1984180200911","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}