Free Access
Issue
RAIRO. Inform. théor.
Volume 12, Number 2, 1978
Page(s) 69 - 82
DOI https://doi.org/10.1051/ita/1978120200691
Published online 01 February 2017
  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. [Zbl: 0364.68020]
  2. 2. J. W. DE BAKKER, Least Fixed Points Revisited, Theor. Computer Science, vol. 2, 1976, p. 155-181. [MR: 408290] [Zbl: 0348.68013]
  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. [EuDML: 92047] [MR: 448988] [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. [EuDML: 92055] [MR: 474954] [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. [MR: 148258] [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. [MR: 366112] [Zbl: 0361.68113]
  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. [MR: 440993] [Zbl: 0245.68011]
  13. 13. M. NIVAT, On the Interpretation of Recursive Program Schemes, Symposia Mathematica, vol. 15. 1975, p. 255-281. [MR: 391563] [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. [MR: 429501] [Zbl: 0325.68006]
  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.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.