Sémantique algébrique de l'appel par valeur
Arnold, André
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978), p. 69-82 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1978__12_2_69_0,
     author = {Arnold, Andr\'e},
     title = {S\'emantique alg\'ebrique de l'appel par valeur},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {12},
     year = {1978},
     pages = {69-82},
     mrnumber = {502121},
     zbl = {0378.68008},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1978__12_2_69_0}
}

Arnold, André. Sémantique algébrique de l'appel par valeur. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978) pp. 69-82. http://gdmltest.u-ga.fr/item/ITA_1978__12_2_69_0/

1. E. Astesiano et G. Costa, On Algebraic Semantics of Polyadic Recursive Schemes in Les Arbres en Algèbre et en Programmation, 2nd Colloque, Lille 1977. | Zbl 0364.68020

2. J. W. De Bakker, Least Fixed Points Revisited, Theor. Computer Science, vol. 2, 1976, p. 155-181. | MR 408290 | Zbl 0348.68013

3. G. Boudol, Langages polyadiques algébriques. Théorie des schémas de programme : sémantique de l'appel par valeur, Thèse 3e cycle, Paris, 1975.

4. J. M. Cadiou, Recursive Definitions of Partial Functions and their Computation, Ph. D. Thesis Standford University, 1972.

5. G. Costa, Communication personnelle.

6. J. Engelfriet et E. M. Schmidt, IO and OI, Daimi Report PB 47, University of Aarhus, 1975.

7. I. Guessarian, Les tests et leur caractérisation syntaxique, R.A.I.R.O. série Informatique Théorique, vol. 11, 1977, p. 133-156. | Numdam | MR 448988 | Zbl 0364.68018

8. L. Kott, Sémantique algébrique d'un langage de programmation type Algol, R.A.I.R.O. série Informatique Théorique, vol. 11, 1977, p. 237-263. | Numdam | MR 474954 | Zbl 0369.68008

9. B. Lang, Threshold Evaluation and the Semantics of Call by Value Assignment and Generic Procedure, 4th Ann. A.C.M. Symp. on Principles of Programming Languages, 1977.

10. J. Mccarthy, A Basis for a Mathematical Theory of Computation in Computer Programming and Formal Systems, BRAFFORT et HIRSCHBERG, éd., North Holland, Amsterdam, 1963. | MR 148258 | Zbl 0203.16402

11. T. S. E. Maibaum, A Generalized Approach to Formal Languages, J. Comput. System Sc., vol. 8, 1974, p. 402-432. | MR 366112 | Zbl 0361.68113

12. Z. Manna et J. Vuillemin, Fixpoint Approach to the Theory of Computation, Comm of the Assoc. Comput. Mach., vol. 15, 1972, p. 528-536. | MR 440993 | Zbl 0245.68011

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

14. G.D. Plotkin, Call-by-Name, Call-by-Value and the W-Calculus, Theor. Computer Science, vol. 1, 1975, p. 125-159. | MR 429501 | Zbl 0325.68006

15. D. Scott, Outline of a Mathematical Theory of Computation, Oxford University, 1970.

16. J. Vuillemin, Syntaxe, sémantique et axiomatique d'un langage de programmation simple, Thèse d'État, Paris, 1974.