Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes

Patrice Naudin

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

  • Volume: 21, Issue: 1, page 59-91
  • ISSN: 0988-3754

How to cite

top

Naudin, Patrice. "Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 21.1 (1987): 59-91. <http://eudml.org/doc/92279>.

@article{Naudin1987,
author = {Naudin, Patrice},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {deterministic recursive program scheme; operational semantics; denotational semantics; algebraic semantics; equivalence relation on sets of trees},
language = {fre},
number = {1},
pages = {59-91},
publisher = {EDP-Sciences},
title = {Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes},
url = {http://eudml.org/doc/92279},
volume = {21},
year = {1987},
}

TY - JOUR
AU - Naudin, Patrice
TI - Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1987
PB - EDP-Sciences
VL - 21
IS - 1
SP - 59
EP - 91
LA - fre
KW - deterministic recursive program scheme; operational semantics; denotational semantics; algebraic semantics; equivalence relation on sets of trees
UR - http://eudml.org/doc/92279
ER -

References

top
  1. 1. S. ABRAMSKY, On Semantics Foundations for Applicative Multiprogramming, Lecture notes in Computer Science, vol. 137, 1982. Zbl0538.68064
  2. 2. A. ARNOLD, Sémantique de l'appel par valeur, RAIRO Informatique théorique, vol. 12, n° 2, 1978. Zbl0378.68008MR502121
  3. 3. A. ARNOLD, Schémas de programmes non déterministes avec appel synchrone, inProgram transformations, 3rd international symposium on programming, Dunod, Paris. Zbl0405.68012
  4. 4. A. ARNOLD et M. DAUCHET, Théorie des magmoïdes I, RAIRO Informatique théorique, vol. 12, n° 3, 1978. Zbl0391.68037MR510640
  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. Zbl0577.68032
  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. Zbl0453.68021MR604273
  7. 7. A. ARNOLD et M. NIVAT, Formal Computations of Non-Deterministic Recursive Program Schemes, Math. System Theory, vol. 13, 1980, p. 219-236. Zbl0441.68044MR572496
  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. Zbl0427.68022MR572215
  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. 
  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. 
  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. Zbl0485.68020MR623270
  12. 12. G. BOUDOL, Computational Semantics of Term Rewriting Systems, in Algebraic Methods in Semantics, NIVAT and REYNOLDS Eds., Cambridge University Press. Zbl0611.68007MR835452
  13. 13. I. GUESSARIAN, Algebraic Semantics, Lecture Notes in Computer Science, vol. 99, Springer-Verlag, 1981. Zbl0474.68010MR617908
  14. 14. M. C. B. HENNESSY, Powerdomains and Non Deterministic Definitions, Lecture Notes in Computer Science, vol. 137, 1982. Zbl0486.68009
  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. Zbl0457.68006MR570978
  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. 
  17. 17. M. NIVAT, On the Interpretation of Recursive Polyadic Program Schemes, Symposia Matematica, vol. 15, 1975, p. 255-281. Zbl0346.68041MR391563
  18. 18. M. NIVAT, Interprétation universelle d'un schéma de programmes récursifs, Informatica, vol. 7, 1977, p. 9-16. 
  19. 19. M. NIVAT, Non-Deterministic Programs: an Algebraic Overview, Proceedings of IFIP Congress, 1980, North Holland. Zbl0444.68011MR594940
  20. 20. D. NIWINSKI, Fixed-Point Characterization of Context-Free oo-Languages, Information and Control, vol. 61, n° 3, 1984. Zbl0591.68075MR773406
  21. 21. G. PLOTKIN, A Power Domain Construction, SIAM Journal on Computing, vol. 5, 1976, p. 452-486. Zbl0355.68015
  22. 22. A. POIGNÉ, On Effective Computations of Non-Deterministic Schemes, Lecture Notes in Computer Science, vol. 137, 1982. Zbl0495.68016
  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. Zbl0485.68068MR623284
  24. 24. M. SMYTH, Powerdomains, JCSS, vol. 16, 1978, p. 23-26. Zbl0391.68011MR468292
  25. 25. D. SCOTT, The Lattice of Flow Diagrams, Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics, vol. 182, Springer-Verlag, 1971. Zbl0228.68016MR278849

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.