Skip to main content
Springer Nature Link
Log in

Designs, Disputes and Strategies

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2471))

Included in the following conference series:

  • 572 Accesses

Abstract

Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the “innocent strategy” appraoch to Games Semantics, and thus establish a clear connection between the two subjects.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. In Proceedings LICS’98. IEEE Computer Society Press, 1998.

    Google Scholar 

  2. S. Abramsky and G. McCusker. Computational Logic, chapter Game semantics. Springer-Verlag, 1999.

    Google Scholar 

  3. V. Danos, H. Herbelin, and L. Regnier. Games semantics and abstract machines. In Proceedings LICS’96. IEEE Computer Society Press, 1996.

    Google Scholar 

  4. C. Faggian. On the Dynamics of Ludics. A Study of Interaction. PhD thesis, Université Aix-Marseille II, 2002.

    Google Scholar 

  5. J.-Y. Girard. Geometry of interaction i: Interpretation of system f. In Z. A. Ferro R.m Bonotto C., Valentini S., editor, Logic Colloquium 88, pages 221–260. North Holland, 1989.

    Google Scholar 

  6. J.-Y. Girard. Locus solum. Mathematical Structures in Computer Science, 2001.

    Google Scholar 

  7. M. Hyland and L. Ong. On full abstraction for PCF. Information and Computation, 2000.

    Google Scholar 

  8. M. Hyland and A. Schalk. Abstract Games for Linear Logic. Electronic Notes in Theoretical Computer Science, 29:1–24, 1999.

    Article  MathSciNet  Google Scholar 

  9. H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, LNCS. Springer, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DPMMS-University of Cambridge, UK

    Claudia Faggian & Martin Hyland

Authors
  1. Claudia Faggian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Hyland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory for Foundations of Computer Science Division of Informatics, University of Edinburgh, King’s Buildings, Mayfield Road, Edinburgh, EH9 3JZ, UK

    Julian Bradfield

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Faggian, C., Hyland, M. (2002). Designs, Disputes and Strategies. In: Bradfield, J. (eds) Computer Science Logic. CSL 2002. Lecture Notes in Computer Science, vol 2471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45793-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-45793-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44240-0

  • Online ISBN: 978-3-540-45793-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics