Nondeterminism and fully abstract models
Egidio Astesiano; Gerardo Costa
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1980)
- Volume: 14, Issue: 4, page 323-347
- ISSN: 0988-3754
Access Full Article
top
How to cite
topAstesiano, Egidio, and Costa, Gerardo. "Nondeterminism and fully abstract models." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 14.4 (1980): 323-347. <http://eudml.org/doc/92130>.
@article{Astesiano1980,
author = {Astesiano, Egidio, Costa, Gerardo},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {typed lambda calculus; semantics; nondeterministic languages},
language = {eng},
number = {4},
pages = {323-347},
publisher = {EDP-Sciences},
title = {Nondeterminism and fully abstract models},
url = {http://eudml.org/doc/92130},
volume = {14},
year = {1980},
}
TY - JOUR
AU - Astesiano, Egidio
AU - Costa, Gerardo
TI - Nondeterminism and fully abstract models
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1980
PB - EDP-Sciences
VL - 14
IS - 4
SP - 323
EP - 347
LA - eng
KW - typed lambda calculus; semantics; nondeterministic languages
UR - http://eudml.org/doc/92130
ER -
References
top- 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. Zbl0416.68033MR573231
- 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. Zbl0382.68041MR520840
- 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. Zbl0379.02015
- 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. Zbl0316.68017MR416095
- 5. R. MILNER, Fully Abstract Models of Typed λ-Calculi, Theoret. Comput. Sc., Vol. 4, 1977, pp. 1-22. Zbl0386.03006MR498061
- 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. Zbl0355.68015MR445891
- 8. G. PLOTKIN, LCF as a Programming Language, Theoret. Comput. Sc., Vol. 1977, pp. 223-255. Zbl0369.68006MR484798
- 9. G. PLOTKIN, Personal communication, 1978.
- 10. M. B. SMYTH, Power Domains, J. Comput. System Sc., Vol. 16, 1978, pp. 23-36. Zbl0391.68011MR468292
NotesEmbed ?
topYou 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.