Sémantique algébrique d'un langage de programmation type Algol
Kott, Laurent
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977), p. 237-263 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1977__11_3_237_0,
     author = {Kott, Laurent},
     title = {S\'emantique alg\'ebrique d'un langage de programmation type Algol},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {11},
     year = {1977},
     pages = {237-263},
     mrnumber = {474954},
     zbl = {0369.68008},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1977__11_3_237_0}
}

Kott, Laurent. Sémantique algébrique d'un langage de programmation type Algol. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) pp. 237-263. http://gdmltest.u-ga.fr/item/ITA_1977__11_3_237_0/

1. J. J. Arsac, Nouvelles leçons de programmation, Publication de l'I.P., n° 75-29, Université Paris VI, Paris, 1975.

2. R. Burstall and J. Darlington, A Transformation System for Developing Recursive Programs, Journal of Ass. Comp. Mach., Vol. 24, 1977, pp. 44-67. | MR 451816 | Zbl 0343.68014

3. G. Berry et B. Courcelle, Program Equivalence and Canonical Forms in Stable Discrete Interpretations, 3° Colloque International, Automata, Languages and Programming, S. Michaelson, R. Milner Eds., pp. 168-188, Edinburgh University Progra Press, 1976. | Zbl 0363.68036

4. G. Cousineau, Les arbres à feuilles indicées : un cadre algébrique pour l'étude des structures de contrôle, Thèse d'État, Université Paris-VII, Paris, 1977.

5. I. Guessarian, Semantic Equivalence of Program Schemes and its Syntactic Characterization, 3° Colloque International, Automata, Languages and Programming, S. Michaelson, R. Milner Eds., Edinburgh University Press, 1976, pp. 189- 200. | Zbl 0364.68019

6. L. Guessarian, Les tests et leur caractérisation syntaxique, R.A.I.R.O. série Informatique Théorique n° 2 1977, pp. 133-156. | Numdam | MR 448988 | Zbl 0364.68018

7. I. Ianov, The Logical Schemes of Algorithms, in Problems of Cybernetics, London, Pergamon Press, 1960, pp. 82-140. | Zbl 0142.24801

8. L. Kott, Systèmes schématiques généralisés, Theoretical Computer Science, 3rd GI Conference, Darmstadt, Lecture Notes in Computer Science 48, H. Tzschach, H. Waldschmidt, H. K.-G. Walter Eds., Springer-Verlag, 1977, pp. 184-189. | MR 502297 | Zbl 0375.68015

9. L. Kott, Approche par le magma d'un langage de programmation type Algol : sémantique et vérification de programm, Thèse 3° cycle, Université Paris-VII, Paris, 1976.

10. L. Kott, Sémantique algébrique et principe d'induction : l'induction de Kleene, soumis à publication, 1977.

11. J. Mccarthy, A Basis for a Mathematical Theory of Computation, in Computer Programming and Formal Systems, P. Braffort, D. Hirschberg Eds., North-Holland, Amsterdam, 1963, pp. 33-70. | MR 148258 | Zbl 0203.16402

12. Z. Manna, Mathematical Theory of Computation, McGraw-Hill, New York, 1974. | MR 400771 | Zbl 0353.68066

13. Z. Manna and J. Vuillemin, Fixpoint Approach to the Theory of Computation, Comm. of Ass. Comp. Mach. 15, 1972, pp. 528-536. | MR 440993 | Zbl 0245.68011

14. M. Nivat, Sur l'interprétation des schémas de programme monadique, Rapport IRIA-Laboria n°1, 1972.

15. M. Nlvat, On the Interpretation of Recursive Polyadic Schemes, Instituto Nazionale di Alta Matematica, Symposia Mathematica, Volume XV, 1974, pp. 251-281.

16. D. Park, Fixpoint Induction and Proof of Program Properties, Machine Intelligence 5, B. Meltzer, D. Michie Eds., 1969, pp. 59-78. | MR 323149 | Zbl 0219.68007

17. D. Scott and C. Strachey, Towards a Mathematical Semantics for Computer Languages, Technical Memo PRC-G, Oxford University, Oxford, 1970.