Full abstraction for a simple parallel programming language

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 74 LNCS, Issue , 1979, Pages 108-120

  Hennessy, M C B ^a   Plotkin, G D ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034261970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-09526-8_8     Document Type: Conference Paper

References (11)

1. Brinch Hansen, P. (1978), Distributed Processes: A Concurrent Programming Concept. Comm. ACM 21, 11, pp. 934–940.
2. Egli, H. (1975): A Mathematical Model for Nondeterministic Computation.
3. Hennessy, M. C. B. and Ashcroft, E. A. (1979): A Mathematical Semantics for a Nondeterministic Typed λ-calculus. To appear.
4. Hoare, C. A. R. (1978): Communicating Sequential Processes. Comm. ACM 21, 8, pp. 666–677.
5. Mac Lane, S. (1971): Categories for the Working Mathematician. Berlin, Springer Verlag.
6. Milne, G. J. and Milner, R. (1977): Concurrent processes and their syntax. To appear in the J. A. C. M.
7. Milner, R. (1977): Fully Abstract Models of Typed λ-calculi. T. C. S.
8. Plotkin, G. D. (1976): A Powerdomain Construction. SIAM Journal on Computing 5, 3, pp. 452–487.
9. Plotkin, G. D. (1977): LCF Considered as a Programming Language. T. C. S. 5, pp. 223–255.
10. Smyth, M. (1978): Powerdomains. J. C. S. S. 16, 1.
11. Smyth, M. and Plotkin, G. D. (1978): The Category Theoretic Solution of Recursive Domain Equations. University of Edinburgh: D. A. I. Research Report No 60.