We refine previous analyses of Hyland-Ong game semantics and its relation to λ- and λμ-calculi and present improved factorization results for bracketing and rigidity that can be combined in any order.


Initial Move View Function Game Semantic Full Abstraction Type Lambda Calculus 
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.
    Danos, V., Harmer, R.: The anatomy of innocence. In: Proceedings, Tenth Annual Conference of the European Association for Computer Science Logic. Springer, Heidelberg (2001)Google Scholar
  2. 2.
    Harmer, R.: Innocent game semantics. Lecture notes (2004–2006)Google Scholar
  3. 3.
    Herbelin, H.: Games and weak-head reduction for classical PCF. In: Proceedings, Third International Conference on Typed Lambda Calculi and Applications. LNCS. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Information and Computation 163, 285–408 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Laird, J.: Full abstraction for functional languages with control. In: Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (1997)Google Scholar
  6. 6.
    Laurent, O.: Polarized games. Annals of Pure and Applied Logic 130(1-3), 79–123 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Nickau, H.: Hereditarily sequential functionals. In: Proceedings, Logical Foundations of Computer Science. LNCS. Springer, Heidelberg (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Russ Harmer
    • 1
  • Olivier Laurent
    • 1
  1. 1.PPS, CNRS and Université Paris 7 

Personalised recommendations