no. 2
Définitions récursives par cas
RAIRO. Informatique théorique, Tome 18 (1984) no. 2, pp. 91-129 
@article{ITA_1984__18_2_91_0,
     author = {Courcelle, B. and Lavandier, F.},
     title = {D\'efinitions r\'ecursives par cas},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {91--129},
     year = {1984},
     publisher = {EDP Sciences},
     volume = {18},
     number = {2},
     mrnumber = {761512},
     zbl = {0562.68004},
     language = {fr},
     url = {https://www.numdam.org/item/ITA_1984__18_2_91_0/}
}
TY  - JOUR
AU  - Courcelle, B.
AU  - Lavandier, F.
TI  - Définitions récursives par cas
JO  - RAIRO. Informatique théorique
PY  - 1984
SP  - 91
EP  - 129
VL  - 18
IS  - 2
PB  - EDP Sciences
UR  - https://www.numdam.org/item/ITA_1984__18_2_91_0/
LA  - fr
ID  - ITA_1984__18_2_91_0
ER  - 
%0 Journal Article
%A Courcelle, B.
%A Lavandier, F.
%T Définitions récursives par cas
%J RAIRO. Informatique théorique
%D 1984
%P 91-129
%V 18
%N 2
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1984__18_2_91_0/
%G fr
%F ITA_1984__18_2_91_0
Courcelle, B.; Lavandier, F. Définitions récursives par cas. RAIRO. Informatique théorique, Tome 18 (1984) no. 2, pp. 91-129. https://www.numdam.org/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. | Zbl | MR

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. | Zbl | MR

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

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

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

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 | Zbl | MR

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

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

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

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

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. | Zbl | MR

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

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

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. | Zbl | MR

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

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. | Zbl | MR

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

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

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

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

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. | Zbl | MR

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

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

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.