Geodesic
Sémantique des processus communicants
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 15 (1981) no. 2, pp. 103-139.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1981__15_2_103_0,
     author = {Arnold, Andr\'e},
     title = {S\'emantique des processus communicants},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {103--139},
     publisher = {EDP-Sciences},
     volume = {15},
     number = {2},
     year = {1981},
     mrnumber = {618450},
     zbl = {0463.68033},
     language = {fr},
     url = {http://geodesic.mathdoc.fr/item/ITA_1981__15_2_103_0/}
}
TY  - JOUR
AU  - Arnold, André
TI  - Sémantique des processus communicants
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1981
SP  - 103
EP  - 139
VL  - 15
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1981__15_2_103_0/
LA  - fr
ID  - ITA_1981__15_2_103_0
ER  - 
%0 Journal Article
%A Arnold, André
%T Sémantique des processus communicants
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1981
%P 103-139
%V 15
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1981__15_2_103_0/
%G fr
%F ITA_1981__15_2_103_0
Arnold, André. Sémantique des processus communicants. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 15 (1981) no. 2, pp. 103-139. http://geodesic.mathdoc.fr/item/ITA_1981__15_2_103_0/

1. A. Arnold et M. Nivat, Non Deterministic Recursive Program Schemes, in Fundamentals of Computation Theory, Poznan, 1977, M. KARPINSKI, éd., Lecture Notes in Computer Science, n° 56, Springer-Verlag, 1977, p. 12-21. | Zbl | MR

2. A. Arnold et M. Nivat, The Metric Space of Infinite Trees. Algebraic and Topological Properties, Rapport I.R.I.A.-Laboria, n° 323, 1978.

3. L. Boasson et M. Nivat, Adherences of Languages, J. Comput. Sys. Sci. vol. 20, 1980, p. 285-309. | Zbl | MR

4. S. Eilenberg et D. Montgomery, Fixed Point Theorems for Muhi-Valued Transformations, Amer. J. Math., vol. 68, 1946, p. 214-222. | Zbl | MR

5. G. Kahn, The Semantics of a Simple Language for Parallel Processing, Proc. I.F.I.P. Congress, 1974. | Zbl

6. R. M. Keller, Denotational Models for Parallel Programs with Indeterminate Operators, in [11], p. 337-363. | Zbl | MR

7. R. Milner, Processus: a Mathematical Model of Computing Agents, in Proc. Logic Colloquium, Bristol, North-Holland Pub. Co., 1973, p. 157-173. | Zbl | MR

8. M. Nivat, Mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, vol. 11, 1977, p. 311-327. | Zbl | MR | mathdoc-id

9. G. D. Plotkin, A Powerdomain Construction, S.I.A.M. J. Comp., vol. 5, 1976, p. 452-486. | Zbl | MR

10. E. Wiedmer, Exaktes Rechnen mit reellen Zahlen und anderen unendlichen objekten, Doctoral Dissertation, E.T.H., Zurich, 1977. | MR

11. Formal Descriptions of Programming Concepts E. J. NEUHOLD, éd., North-Holland Pub. Co., 1978. | Zbl | MR