A game semantics of idealized CSP

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 232-257

  Laird, J ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; SEMANTICS; SYNCHRONIZATION;

FACTORIZATION; GAMES SEMANTICS; SEQUENTIAL LANGUAGES; SYNCHRONOUS COMMUNICATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 18944391908     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80965-4     Document Type: Conference Paper

References (19)

1. Abramsky S., McCusker G. Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. O'Hearn P.W., Tennent R. Algol-like languages. 1997;Birkhauser
2. th Annual workshop proceedings, LNCS, pages 1-17. Springer-Verlag, 1998.
3. S. Abramsky, and P.-A. Mellies. Concurrent games and full completeness. In Proceedings of the 14th annual Symposium on Logic In Computer Science, LICS '99, 1999.
4. S. Abramsky, K. Honda, G. McCusker. A fully abstract games semantics for general references. In Proceedings of the 13th Annual Symposium on Logic In Computer Science, LICS '98, 1998.
5. Abramsky S., Jagadeesan R. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic. 59:1994;543-574
6. Abramsky S., Jagadeesan R., Malacaria P. Full abstraction for PCF. Accepted for publication in Information and Computation. 1996
7. S. Brookes. Idealized CSP: Combining procedures with communicating processes. In Proceedings of MFPS '97, Electronic notes in Theoretical Computer Science. Elsevier-North Holland, 1997.
8. R. Harmer and G. McCusker. A fully abstract games semantics for finite non-determinism. In Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS '99. IEEE Press, 1998.
9. Hennessy M., Ashcroft E. A mathematical semantics for a non-deterministic typed π-calculus. Theoretical Computer Science. 11:1980;227-245
10. Hoare C.A.R. Communicating sequential processes. Communications of the ACM. 21:(8):1978;666-677
11. K. Honda and N. Yoshida. Game theoretic analysis of call-by-value computation. In Proceedings of 24th International Colloquium on Automata, Languages and Programming, volume 1256 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
12. J. M. E. Hyland, and C.-H. L. Ong. On full abstraction for PCF: I, II and III, 1995. To appear in Theoretical Computer Science.
13. J. Laird. Full abstraction for functional languages with control. In Proceedings of the Twelfth International Symposium on Logic In Computer Science, LICS '97, 1997.
14. J. Laird. A fully abstract game semantics of local exceptions. In Proceedings of the Sixteenth International Symposium on Logic In Computer Science, LICS '01, 2001. To appear.
15. G. McCusker. Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London, 1996.
16. H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, LNCS. Springer-Verlag, 1994.
17. J. Reppy. Higher Order Concurrency. PhD thesis, Cornell University, 1992.
18. th ACM Symposium on Principles of Programming Languages, pages 39-46, 1978.
19. Reynolds J. The essence of Algol. Algorithmic Languages. 1981;345-372 North Holland