Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4337))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Harmer, R.: Innocent game semantics. Lecture notes (2004–2006)

    Google Scholar 

  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. Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Information and Computation 163, 285–408 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  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. Laurent, O.: Polarized games. Annals of Pure and Applied Logic 130(1-3), 79–123 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Nickau, H.: Hereditarily sequential functionals. In: Proceedings, Logical Foundations of Computer Science. LNCS. Springer, Heidelberg (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harmer, R., Laurent, O. (2006). The Anatomy of Innocence Revisited. In: Arun-Kumar, S., Garg, N. (eds) FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2006. Lecture Notes in Computer Science, vol 4337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944836_22

Download citation

  • DOI: https://doi.org/10.1007/11944836_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49994-7

  • Online ISBN: 978-3-540-49995-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics