Game semantics for higher-order concurrency

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

Volumn 4337 LNCS, Issue , 2006, Pages 417-428

  Laird, J ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); SOFTWARE ENGINEERING;

ASYNCHRONOUS COMMUNICATION; AUTOMORPHISMS; CALL-BY-VALUE LAMBDA CALCULUS; FUNCTIONAL LANGUAGES; GAME SEMANTICS; HIGHER-ORDER; MULTIPLE THREADS; NATURAL NUMBER;

SEMANTICS;

EID: 80052145215     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_38     Document Type: Conference Paper

References (18)

1. W.Ferreira, M.Hennessy, and A. S. A.Jeffrey.A theory of weak bisimulation for core CML. J. Functional Programming, 8(5):447–491, 1998.
2. D.Ghica and G.McCusker.The regular language semantics of second-order Idealised Algol.Theoretical Computer Science, 309:469 – 502, 2003.
3. D.Ghica and A.Murawski. Angelic semantics of fine-grained concurrency. In Proceedings of FOSSACS’04, number 2987 in LNCS, pages 211–225. Springer, 2004.
4. R.Harmer and G.McCusker.A fully abstract games semantics for finite non-determinism. In Proceedings of LICS’99. IEEE Computer Society Press, 1998.
5. K.Honda and N.Yoshida.Game theoretic analysis of call-by-value computation.In Proceedings of ICALP’97, volume 1256 of LNCS.Springer-Verlag, 1997.
6. D.Hughes. Games and definability for System F.In Proceedings of LICS’97. IEEE Computer Society Press, 1997.
7. J. M. E.Hyland and C.-H. L.Ong.On full abstraction for PCF: I, II and III. Information and Computation, 163:285–408, 2000.
8. A. S. A.Jeffrey and J.Rathke. Contextual equivalence for higher-order pi-calculus revisited. In Logical Methods in Computer Science 1(1:4), 2002.
9. A. S. A.Jeffrey and J.Rathke. A fully abstract may-testing semantics for concurrent objects. In Proceedings of LICS’02, pages 101–112, 2002.
10. J.Laird. A game semantics of ICSP. In Proceedings of MFPS XVII, number 45 in Electronic notes in Theoretical Computer Science. Elsevier, 2001.
11. J. Laird. A game semantics of names and pointers. To appear in Annals of Pure and Applied Logic, available from http://www.cogs.susx.ac.uk/users/jiml, 2005.
12. J.Laird. A game semantics of the asynchronous pi-calculus. In Proceedings of CONCUR’05, number 3653 in LNCS, pages 51–65. Springer, 2005.
13. O.Laurent. Polarized games.In Proceedings of LICS’02, 2002.
14. P.Malacaria and C.Hankin.Generalised flowcharts and games.In Proceedings of ICALP’98, 1998.
15. G.McCusker. Games and full abstraction for a functional metalanguage with recursive types.PhD thesis, Imperial College London, 1996.
16. J.Power and E.Robinson.Premonoidal categories and notions of computation.Mathematical Structures in Computer Science, 1997.
17. J.Reppy. CML: A higher-order concurrent language. In Proceedings of PLDI’91, pages 293–305. ACM Press, 1991.
18. D.Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms.PhD thesis, University of Edinburgh, 1993.