Définitions récursives par cas
Courcelle, B. ; Lavandier, F.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984), p. 91-129 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1984__18_2_91_0,
     author = {Courcelle, B. and Lavandier, F.},
     title = {D\'efinitions r\'ecursives par cas},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {18},
     year = {1984},
     pages = {91-129},
     mrnumber = {761512},
     zbl = {0562.68004},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1984__18_2_91_0}
}

Courcelle, B.; Lavandier, F. Définitions récursives par cas. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984) pp. 91-129. http://gdmltest.u-ga.fr/item/ITA_1984__18_2_91_0/

1. S. Bloom et R. Tindell, Varieties of if Then-else, Siam J. Comput. vol. 12, 1983, p. 677-707. | MR 721007 | Zbl 0518.68010

2. G. Boudol, Calculs maximaux et sémantique opérationnelle des programmes non déterministes, Thèse doctorat, Université de Paris-7, 1980.

3. B. Courcelle, Infinite Trees in Normal Form and Recursive Equations having a Unique Solution, Math. Systems Theory, vol. 13, 1979, p. 131-180. | MR 553879 | Zbl 0418.68013

4. B. Courcelle, Fundamental Properties of Infinite Trees, Theor. Comput. Sc., vol. 25, 1984, p. 95-169. | MR 693076 | Zbl 0521.68013

5. B. Courcelle, An Axiomatic Approach to the Korenjak-Hopcroft Algorithms, Math. Systems Theory, vol. 16, 1983, p. 191-231. | MR 702448 | Zbl 0581.68032

6. B. Courcelle et P. Franchi-Zannettacci, Attribute Grammars and Recursive Program Schemes, Theor. Comput. Sc., vol. 17, 1982, p. 163-191 and p. 235-257. | Zbl 0481.68068

7. B. Courcelle et F. Lavandier, 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-204 | MR 744210 | Zbl 0518.68015

8. B. Courcelle, M. Nivat, The algebraic semantics of recursive program schemes: MFCS'78, Lec. Notes Comput. Sc., vol. 64, p. 16-30. | MR 519827 | Zbl 0384.68016

9. J. Darlington, R. Burstall, A System which Automatically Improves Program, Acta Informatica, vol. 6, 1976, p. 41-60. | Zbl 0323.68008

10. E. Friedman, Equivalence Problems for Deterministic Context-free Languages andMonadic Recursion Schemes, J. Comput. System Sc., 14, 1977, p. 334-359. | MR 443445 | Zbl 0358.68109

11. S. Garland et D. Luckham, Program Schemes, Recursion Schemes and Formal Languages, J. Comput. System Sc., vol.7, 1973, p. 119-160. | MR 315930 | Zbl 0277.68010

12. J. Goguen, J. Thatcher, E. Wagner et J. Wright, Initial Algebra Semantics and Continuons Algebras, J. Assoc. Comput. Mach., vol. 24, 1977, p. 68-95. | MR 520711 | Zbl 0359.68018

13. I. Guessarian, Algebraic Semantics, Lec. Notes Comput. Sc., vol. 99, Springer-Verlag, 1981. | MR 617908 | Zbl 0474.68010

14. G. Huet, Confluent Reductions, Abstract Properties and Applications to Term Rewriting Systems, J. Assoc. Comput. Mach., vol. 27, 1980, p. 797-821. | MR 594700 | Zbl 0458.68007

15. G. Huet et J. M. Hullot, Proofs by induction in Equational Theories with Constructors, I. Compt. System Sc., Vol. 25, 1982, p. 239-266. | MR 680519 | Zbl 0532.68041

16. G. Huet et B. Lang, Proving and Applyind Program Transformations Expressed with 2nd Order Patterns, Acta Informatica, vol.11, 1978, p. 31-55. | MR 514752 | Zbl 0389.68008

17. G. Huet et J. J. Levy, Call by Need Computations in Nonambigous Linear Term Rewriting System, Laboria report, vol. 359, 1979.

18. G. Huet et D. Oppen, Equations and Rewrite Rules, a Survey, Proceedings of the International Symposium on Formal Languages Theory, Santa Barbara, California (December 10-14, 1979),

19. F. Lavandier, Sur les systèmes de définitions récursives par cas. Application à la sémantique dénotationnelle, Thèse de 3e cycle, Université de Bordeaux-I, 1982.

20. Z. Manna, A. Shamir, The Theoretical Aspects of the Optimal Fixedpoint, S.I.A.M., J. Comput., vol. 5, 1976, p. 414-426. | MR 440995 | Zbl 0358.68017

21. B. Mayoh, Attribute Grammars and Mathematical Semantics; S.I.A.M. J. Comput., vol. 10, 1981, p. 503-518. | MR 623062 | Zbl 0462.68062

22. M. Nivat, On the Interpretation of Polyadic Recursive Program Schemes, Symposia Mathematica, vol.15, Academic Press, 1975, p. 255-281. | MR 391563 | Zbl 0346.68041

23. J. C. Raoult et J. Vuillemin, Operational and Semantic Equivalence between Recursive Programs, J. Assoc. Comput. Mach., vol. 27, 1980, p. 772-796. | MR 594699 | Zbl 0447.68004

24. B. Rosen, Tree Manipulation Systems and Church-Rosser Theorems, J. Assoc. Comput. Mach., vol. 20, 1973, p. 160-187. | MR 331850 | Zbl 0267.68013

25. J. Stoy, Semantic models, in Theoretical Foundations of Programming Methodology,M. Broy and G. Schmidt, éd., D. Reidel Pub. Co., Dordrecht, Holland, 1982, p. 293-325. | MR 696964 | Zbl 0513.68072

26. R. Tennent, The denotational Semantics of Programming Languages, Comm. of A.C.M., vol.19-8, 1976, p.437-453. | MR 428771 | Zbl 0337.68010

27. S. Walker et H. Strong, Characterizations of Flow-chartable Recursions, J. Comput. System Sc., vol. 7, 1973, p. 404-447. | MR 331854 | Zbl 0266.68011

28. J. Engelfriet, Some Open Questions and Recent Results on Tree Transducers and Tree Languages, même volume que [18]

29. P. Franchi-Zannettacci, Attributs sémantiques et schémas de programmes, Thèse d'État, Université de Bordeaux-I, 1982.