EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 21 / No 1 (1987) RAIRO-Theor. Inf. Appl., 21 1 (1987) 59-91 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 21, Number 1, 1987
Page(s) 59 - 91
DOI https://doi.org/10.1051/ita/1987210100591
Published online 01 February 2017
  1. 1. S. ABRAMSKY, On Semantics Foundations for Applicative Multiprogramming, Lecture notes in Computer Science, vol. 137, 1982. [Zbl: 0538.68064] [Google Scholar]
  2. 2. A. ARNOLD, Sémantique de l'appel par valeur, RAIRO Informatique théorique, vol. 12, n° 2, 1978. [EuDML: 92070] [MR: 502121] [Zbl: 0378.68008] [Google Scholar]
  3. 3. A. ARNOLD, Schémas de programmes non déterministes avec appel synchrone, inProgram transformations, 3rd international symposium on programming, Dunod, Paris. [Zbl: 0405.68012] [Google Scholar]
  4. 4. A. ARNOLD et M. DAUCHET, Théorie des magmoïdes I, RAIRO Informatique théorique, vol. 12, n° 3, 1978. [EuDML: 92079] [MR: 510640] [Zbl: 0391.68037] [Google Scholar]
  5. 5. A. ARNOLD, P. NAUDIN et M. NIVAT, On Semantics of Non-Deterministic Recursive Program Schemes, in Algebraic Methods in Semantics, NIVAT and REYNOLDS Eds., Cambridge University Press. [Zbl: 0577.68032] [Google Scholar]
  6. 6. A. ARNOLD et M. NIVAT, The Metric Space of Infinite Trees. Algebraic and Topological Properties, Fundamenta Informaticae, vol. 4, 1980, p. 445-476. [MR: 604273] [Zbl: 0453.68021] [Google Scholar]
  7. 7. A. ARNOLD et M. NIVAT, Formal Computations of Non-Deterministic Recursive Program Schemes, Math. System Theory, vol. 13, 1980, p. 219-236. [MR: 572496] [Zbl: 0441.68044] [Google Scholar]
  8. 8. A. ARNOLD et M. NIVAT, Metric Interpretations of Infinite Trees and Semantics of Non-Deterministic Recursive Program Schemes, Theoretical Computer Science, vol. 11, 1980, p. 181-205. [MR: 572215] [Zbl: 0427.68022] [Google Scholar]
  9. 9. A. ARNOLD et M. NIVAT, Fair or-Trees and Non-Deterministic Program Schemes, In 2nd International Workshop on Semantics, Bad-Honnef, 1979, Bulletin of EATCS, vol. 8, 1979, p. 104-105. [Google Scholar]
  10. 10. G. BOUDOL, Sémantique opérationnelle et algébrique des programmes récursifs non déterministes. Thèse d'État, Université de Paris-VII, 1980. [Google Scholar]
  11. 11. G. BOUDOL, Une sémantique pour les arbres non déterministes, In 6th CAAP, Lecture Notes in Computer Science, vol. 112, 1981, p. 147-161. [MR: 623270] [Zbl: 0485.68020] [Google Scholar]
  12. 12. G. BOUDOL, Computational Semantics of Term Rewriting Systems, in Algebraic Methods in Semantics, NIVAT and REYNOLDS Eds., Cambridge University Press. [MR: 835452] [Zbl: 0611.68007] [Google Scholar]
  13. 13. I. GUESSARIAN, Algebraic Semantics, Lecture Notes in Computer Science, vol. 99, Springer-Verlag, 1981. [MR: 617908] [Zbl: 0474.68010] [Google Scholar]
  14. 14. M. C. B. HENNESSY, Powerdomains and Non Deterministic Definitions, Lecture Notes in Computer Science, vol. 137, 1982. [Zbl: 0486.68009] [Google Scholar]
  15. 15. M. C. B. HENNESSY et G. D. PLOTKIN, Full Abstraction for a Simple Parallel Programming Language, Lecture Notes in Computer Science, vol. 74, 1979. [MR: 570978] [Zbl: 0457.68006] [Google Scholar]
  16. 16. P. NAUDIN, Le problème du non déterminisme dans la sémantique algébrique des schémas de programmes, Thèse de 3e cycle, Université de Poitiers, 1982. [Google Scholar]
  17. 17. M. NIVAT, On the Interpretation of Recursive Polyadic Program Schemes, Symposia Matematica, vol. 15, 1975, p. 255-281. [MR: 391563] [Zbl: 0346.68041] [Google Scholar]
  18. 18. M. NIVAT, Interprétation universelle d'un schéma de programmes récursifs, Informatica, vol. 7, 1977, p. 9-16. [Google Scholar]
  19. 19. M. NIVAT, Non-Deterministic Programs: an Algebraic Overview, Proceedings of IFIP Congress, 1980, North Holland. [MR: 594940] [Zbl: 0444.68011] [Google Scholar]
  20. 20. D. NIWINSKI, Fixed-Point Characterization of Context-Free oo-Languages, Information and Control, vol. 61, n° 3, 1984. [MR: 773406] [Zbl: 0591.68075] [Google Scholar]
  21. 21. G. PLOTKIN, A Power Domain Construction, SIAM Journal on Computing, vol. 5, 1976, p. 452-486. [Zbl: 0355.68015] [Google Scholar]
  22. 22. A. POIGNÉ, On Effective Computations of Non-Deterministic Schemes, Lecture Notes in Computer Science, vol. 137, 1982. [Zbl: 0495.68016] [Google Scholar]
  23. 23. N. POLIAN, Différents types de dérivations infinies dans les grammaires algébriques d'arbres, in 6th CAAP, Lectures Notes in Computer Science, vol. 112, 1981, p. 340-349. [MR: 623284] [Zbl: 0485.68068] [Google Scholar]
  24. 24. M. SMYTH, Powerdomains, JCSS, vol. 16, 1978, p. 23-26. [MR: 468292] [Zbl: 0391.68011] [Google Scholar]
  25. 25. D. SCOTT, The Lattice of Flow Diagrams, Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics, vol. 182, Springer-Verlag, 1971. [MR: 278849] [Zbl: 0228.68016] [Google Scholar]

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.