Semantique algébrique de l’appel par valeur. (French) Zbl 0378.68008


68N01 General topics in the theory of software
68Q45 Formal languages and automata
Full Text: EuDML


[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 · Zbl 0364.68020
[2] 2. J. W. DE BAKKER, Least Fixed Points Revisited, Theor. Computer Science, vol. 2, 1976, p. 155-181. Zbl0348.68013 MR408290 · Zbl 0348.68013 · doi:10.1016/0304-3975(76)90031-1
[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.68018 MR448988 · Zbl 0364.68018
[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.68008 MR474954 · Zbl 0369.68008
[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.16402 MR148258 · Zbl 0203.16402
[11] 11. T. S. E. MAIBAUM, A Generalized Approach to Formal Languages, J. Comput. System Sc., vol. 8, 1974, p. 402-432. Zbl0361.68113 MR366112 · Zbl 0361.68113 · doi:10.1016/S0022-0000(74)80031-0
[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.68011 MR440993 · Zbl 0245.68011 · doi:10.1145/361454.361460
[13] 13. M. NIVAT, On the Interpretation of Recursive Program Schemes, Symposia Mathematica, vol. 15. 1975, p. 255-281. Zbl0346.68041 MR391563 · Zbl 0346.68041
[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.68006 MR429501 · Zbl 0325.68006 · doi:10.1016/0304-3975(75)90017-1
[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.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.