Nondeterminism and fully abstract models
RAIRO. Informatique théorique, Tome 14 (1980) no. 4, pp. 323-347.
@article{ITA_1980__14_4_323_0,
     author = {Astesiano, Egidio and Costa, Gerardo},
     title = {Nondeterminism and fully abstract models},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {323--347},
     publisher = {EDP-Sciences},
     volume = {14},
     number = {4},
     year = {1980},
     mrnumber = {607435},
     zbl = {0463.03024},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1980__14_4_323_0/}
}
TY  - JOUR
AU  - Astesiano, Egidio
AU  - Costa, Gerardo
TI  - Nondeterminism and fully abstract models
JO  - RAIRO. Informatique théorique
PY  - 1980
SP  - 323
EP  - 347
VL  - 14
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1980__14_4_323_0/
LA  - en
ID  - ITA_1980__14_4_323_0
ER  - 
%0 Journal Article
%A Astesiano, Egidio
%A Costa, Gerardo
%T Nondeterminism and fully abstract models
%J RAIRO. Informatique théorique
%D 1980
%P 323-347
%V 14
%N 4
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1980__14_4_323_0/
%G en
%F ITA_1980__14_4_323_0
Astesiano, Egidio; Costa, Gerardo. Nondeterminism and fully abstract models. RAIRO. Informatique théorique, Tome 14 (1980) no. 4, pp. 323-347. http://www.numdam.org/item/ITA_1980__14_4_323_0/

1. E. Astesiano and G. Costa, Sharing in Nondeterminism, Proc. of the 6th I.C.A.L.P., Graz, 1979, Lecture Notes in Comput. Sc, Springer, Berlin, Vol. 71, 1979, pp.1-15. | MR | Zbl

2. G. Berry, Stable Models of Typed λ-calculi, Proc. of the 5th I.C.A.L.P., Udine, 1978, Lecture Notes in Comput. Sc, Springer, Berlin, Vol. 62, 1978, pp. 72-89. | MR | Zbl

3. M. Hennessy and E. A. Ashcroft, The Semantics of Nondeterminism, Proc. of the 3rd I.C.A.L.P., Edinburg, 1976, Edinburg University Press, 1976, pp. 478-493. | Zbl

4. R. Milner, Processes, a Mathematical Model for Computing Agents, Logic Colloquium '73, Studies in Logic and the Foundat. of Math., North Holland-American Elsevier, Vol. 80, 1975, pp, 157-174. | MR | Zbl

5. R. Milner, Fully Abstract Models of Typed λ-Calculi, Theoret. Comput. Sc., Vol. 4, 1977, pp. 1-22. | MR | Zbl

6. G. Plotkin, Lambda Definability and Logical Relations, Memo SAI-RM-4, School of Artif. Intell., Edinburg, 1973.

7. G. Plotkin, A Powerdomain Construction, S.I.A.M. J. Comput., Vol. 5, 1976, pp. 453-487. | MR | Zbl

8. G. Plotkin, LCF as a Programming Language, Theoret. Comput. Sc., Vol. 1977, pp. 223-255. | MR | Zbl

9. G. Plotkin, Personal communication, 1978.

10. M. B. Smyth, Power Domains, J. Comput. System Sc., Vol. 16, 1978, pp. 23-36. | MR | Zbl