Sémantique algébrique de l'appel par valeur

André Arnold

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1978)

  • Volume: 12, Issue: 2, page 69-82
  • ISSN: 0988-3754

How to cite

top

Arnold, André. "Sémantique algébrique de l'appel par valeur." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 12.2 (1978): 69-82. <http://eudml.org/doc/92070>.

@article{Arnold1978,
author = {Arnold, André},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {2},
pages = {69-82},
publisher = {EDP-Sciences},
title = {Sémantique algébrique de l'appel par valeur},
url = {http://eudml.org/doc/92070},
volume = {12},
year = {1978},
}

TY - JOUR
AU - Arnold, André
TI - Sémantique algébrique de l'appel par valeur
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1978
PB - EDP-Sciences
VL - 12
IS - 2
SP - 69
EP - 82
LA - fre
UR - http://eudml.org/doc/92070
ER -

References

top
  1. 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. Zbl0364.68020
  2. 2. J. W. DE BAKKER, Least Fixed Points Revisited, Theor. Computer Science, vol. 2, 1976, p. 155-181. Zbl0348.68013MR408290
  3. 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. 4. J. M. CADIOU, Recursive Definitions of Partial Functions and their Computation, Ph. D. Thesis Standford University, 1972. 
  5. 5. G. COSTA, Communication personnelle. 
  6. 6. J. ENGELFRIET et E. M. SCHMIDT, IO and OI, Daimi Report PB 47, University of Aarhus, 1975. 
  7. 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. Zbl0364.68018MR448988
  8. 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. Zbl0369.68008MR474954
  9. 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. 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. Zbl0203.16402MR148258
  11. 11. T. S. E. MAIBAUM, A Generalized Approach to Formal Languages, J. Comput. System Sc., vol. 8, 1974, p. 402-432. Zbl0361.68113MR366112
  12. 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. Zbl0245.68011MR440993
  13. 13. M. NIVAT, On the Interpretation of Recursive Program Schemes, Symposia Mathematica, vol. 15. 1975, p. 255-281. Zbl0346.68041MR391563
  14. 14. G.D. PLOTKIN, Call-by-Name, Call-by-Value and the W-Calculus, Theor. Computer Science, vol. 1, 1975, p. 125-159. Zbl0325.68006MR429501
  15. 15. D. SCOTT, Outline of a Mathematical Theory of Computation, Oxford University, 1970. 
  16. 16. J. VUILLEMIN, Syntaxe, sémantique et axiomatique d'un langage de programmation simple, Thèse d'État, Paris, 1974. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.