no. 2
Les tests et leur caractérisation syntaxique
RAIRO. Informatique théorique, Tome 11 (1977) no. 2, pp. 133-156. 
@article{ITA_1977__11_2_133_0,
     author = {Guessarian, Ir\`ene},
     title = {Les tests et leur caract\'erisation syntaxique},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {133--156},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {11},
     number = {2},
     year = {1977},
     mrnumber = {448988},
     zbl = {0364.68018},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1977__11_2_133_0/}
}
TY  - JOUR
AU  - Guessarian, Irène
TI  - Les tests et leur caractérisation syntaxique
JO  - RAIRO. Informatique théorique
PY  - 1977
SP  - 133
EP  - 156
VL  - 11
IS  - 2
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - http://www.numdam.org/item/ITA_1977__11_2_133_0/
LA  - fr
ID  - ITA_1977__11_2_133_0
ER  - 
%0 Journal Article
%A Guessarian, Irène
%T Les tests et leur caractérisation syntaxique
%J RAIRO. Informatique théorique
%D 1977
%P 133-156
%V 11
%N 2
%I Centrale des revues, Dunod-Gauthier-Villars
%C Montreuil
%U http://www.numdam.org/item/ITA_1977__11_2_133_0/
%G fr
%F ITA_1977__11_2_133_0
Guessarian, Irène. Les tests et leur caractérisation syntaxique. RAIRO. Informatique théorique, Tome 11 (1977) no. 2, pp. 133-156. http://www.numdam.org/item/ITA_1977__11_2_133_0/

1. A. Arnold et M. Dauchet, Bitransductions de forêts, Proceedings of the 3rd Int. Col. «Automata, Languages, Programming », Edinburgh Univ. Press, Edinburgh, 1976p. 74-86. | Zbl

2. J. Arsac, Nouvelles leçons de programmation, Publications de l'Institut de Programmation, n° 75-29, Université Paris 6, Paris, 1975. | MR

3. E. Ashcroft et Z. Manna, The translation of GO TO programs to WHILE programs, Proceedings of the IFIP conference 1971, North-Holland, Amsterdam, 1971, p. 250-255. | MR

4. J. W. De Bakker et D. Scott, A theory of programs, IBM seminar, Vienne, 1969, manuscrit non publié.

5. G. Berry et J. J. Lévy, Minimal and optimal computations of recursive programs, à paraître. | Zbl

6. G. Boudol, Langages d'arbres algébriques, à paraître dans la RAIRO, Paris, 1977.

7. A. K. Chandra, On the properties and applications of program schemes, Ph. D. Thesis, Stanford, 1973.

8. P. M. Cohn, Universal algebra, Harper's series in modem mathematics, Londres, 1965. | MR | Zbl

9. B. Courcelle et I. Guessarian, On algebraic families of interpretations, à paraître.

10. G. Cousineau et J. M. Rifflet. Langages d'interprétation des schémas récursifs, RAIRO, série rouge, vol. 9, Paris, 1975. p. 21-42. | Numdam | MR | Zbl

11. O. J. Dahl, E. Dijkstra et C. A. R. Hoare, Structured programming, APIC studies on data processing, n° 8, Academic Press. Londres, 1972. | MR | Zbl

12. R. W. Floyd, Assigning meanings to programs, Proceedings of a symposium in applied mathematics, Vol. 19, Mathematical aspects of computer science, Rhodes Island, Amer. Math. Soc, 1967, p. 19-32. | MR | Zbl

13. R. W. Floyd et D. E. Knuth, Notes on avoiding GO TO statements, Information processing letters, 1, 1971, p. 23-31.

14. E. P. Friedmann, Deterministic languages and monadic recursion schemes, Ph. D. Thesis, Harvard University, 1974.

15. S. A. Greibach, Theory of program structures : schemes, semantics and verification, Lecture notes in computer science, Vol. 36, Springer-Verlag, 1975. | MR | Zbl

16. I. Guessarian, Schémas de programme récursifs polyadiques : équivalences et classes d'interprétations, Thèse d'État, Université Paris 7, Paris, 1975.

17. I. Guessarian, Équivalences dans l'algèbre des schémas de programme, Proceedings of the 1st Programming symposium, Lecture notes in computer science, Vol. 19, Springer-Verlag, 1974, p. 204-220. | MR | Zbl

18. I. Guessarian, Semantic equivalence of program schemes and its syntactic characterization, Proceedings of the 3rd Int. Col. «Automata, Languages, Programming», Edinburgh Univ. Press, Edinburgh, 1976, p. 189-200. | Zbl

19. I. Ianov, The logical schemes of algorithms, Problems of cybernetics, Pergamon Press, 1960, p. 82-140. | Zbl

20. L. Kott, Sémantique algébrique d'un langage de programmation type ALGOL, à paraître dans la RAIRO, Paris, 1977. | Numdam | Zbl

21. D. Luckham, D. Park et M. Paterson, On formalized computer programs, J. Comp. Sys. Sc., Vol. 4, 1970, 220-249. | MR | Zbl

22. J. Mac Carthy, A basis for a mathematical theory of computation, Computer programming and formal Systems, P. Braffort, D. Hirschberg Eds., North-Holland, Amsterdam, 1963, p. 33-70. | MR | Zbl

23. Z. Manna, Mathematical theory of computation, Mac Graw Hill, Londres, 1975. | MR | Zbl

24. Z. Manna, S. Ness et J. Vuillemin, Inductive methods for proving properties of programs, C. Ass. Comp. Mac. 16, 1973, p. 491-502. | MR | Zbl

25. R. Milner, Equivalences on program schemes, J. Comp. Sys. Sc, Vol. 4, 1970, p. 205-219. | MR | Zbl

26. M. Nivat, On the interpretation of recursive polyadic program schemes, Atti del convegno di informatica teorica, Symposia Mathematica, Vol. 15, Rome, 1975, p. 256-281. | MR | Zbl

27. M. Nivat, Formalisation de la sémantique des langages de programmation, Bulletin de liaison de la recherche en informatique et automatique, n° 23, IRIA, Paris, 1976, p. 2-13. | Zbl

28. D. Park, Fixpoint induction and proofs of program properties, Machine Intelligence, Vol. 5, Edinburgh University Press, Edinburgh, 1970, p. 59-78. | MR | Zbl

29. M. Paterson, Equivalence problems in a model of computation, Ph. D. Thesis, Artificial intelligence laboratory, M.I.T., 1967.

30. J. D. Rutledge, On Ianov's program schemata, J. Ass. Comp. Mac, Vol. 11, 1964, p. 1-9. | MR | Zbl

31. D. Scott, The lattice of flow diagrams, Symposium on semantics of algorithmic languages, Lecture notes in mathematics, Vol. 188, Springer-Verlag, 1971, p. 311-372. | MR | Zbl

32. H. R. Strong, Translating recursion equations into flowcharts, J. Comp. Sys. Sc, Vol. 5, 1971, p. 254-285. | MR | Zbl

33. N. Wirth, Systematic programming, Prentice Hall, 1973.