We describe a denotational (game) semantics for a call-by-value functional language with multiple threads of control, which may communicate values of general type on locally declared channels.

This develops previous work which interpreted freshly generated names in a category of games acted upon by the group of natural number automorphisms, by showing how names may be associated with “dependent arenas” in which interaction between strategies, corresponding to asynchronous communication on named channels, may occur.

We describe a model of the call-by-value λ-calculus (a closed Freyd category) based on these arenas, and use this as the basis for interpreting our language. We prove that the semantics is fully abstract with respect to may-testing using a correspondence between channel and function types based on the “triggering” representation of procedure-passing in terms of name-passing.


Label Transition System Initial Move Functional Language Denotational Semantic Interaction Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • J. Laird
    • 1
  1. 1.Department of InformaticsUniversity of SussexUK

Personalised recommendations