Skip to main content
SpringerLink
Log in

Projecting Games on Hypercoherences

  • Conference paper
Automata, Languages and Programming (ICALP 2004)

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

Included in the following conference series:

Abstract

We compare two interpretations of programming languages: game semantics (a dynamic semantics dealing with computational traces) and hypercoherences (a static semantics dealing with results of computation). We consider polarized bordered games which are Laurent’s polarized games endowed with a notion of terminated computation (the border) allowing for a projection on hypercoherences. The main result is that the projection commutes to the interpretation of linear terms (exponential-free proofs of polarized linear logic). We discuss the extension to general terms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
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. Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. In: Theoretical Aspects of Computer Software, pp. 1–15 (1994)

    Google Scholar 

  2. Baillot, P., Danos, V., Ehrhard, T., Regnier, L.: Timeless games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 56–77. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theoretical Computer Science 20, 265–321 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bierman, G.M.: What is a categorical model of intuitionistic linear logic? In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  5. Boudes, P.: Non uniform hypercoherences. In: Blute, R., Selinger, P. (eds.) Electronic Notes in Theoretical Computer Science, vol. 69, Elsevier, Amsterdam (2003)

    Google Scholar 

  6. Bucciarelli, A., Ehrhard, T.: Sequentiality in an extensional framework. Information and Computation 110(2) (1994)

    Google Scholar 

  7. Ehrhard, T.: Hypercoherences: a strongly stable model of linear logic. Mathematical Structures in Computer Science 3 (1993)

    Google Scholar 

  8. Ehrhard, T.: A relative definability result for strongly stable functions and some corollaries. Information and Computation 152 (1999)

    Google Scholar 

  9. Ehrhard, T.: Parallel and serial hypercoherences. Theoretical computer science 247, 39–81 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hyland, M., Ong, L.: On full abstraction for PCF: I, II and III. Information and Computation 163(2), 285–408 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Laird, J.: Games and sequential algorithms. Available by http (2001)

    Google Scholar 

  13. Lamarche, F.: Sequentiality, games and linear logic (announcement). In: Workshop on Categorical Logic in Computer Science. Publications of the Computer Science Department of Aarhus University, DAIMI PB-397-II (1992)

    Google Scholar 

  14. Laurent, O.: Étude de la polarisation en logique. Thèse de doctorat, Université Aix-Marseille II (March 2002)

    Google Scholar 

  15. Laurent, O.: Polarized games (extended abstract). In: Proceedings of the seventeenth annual IEEE symposium on Logic In Computer Science, July 2002, pp. 265–274. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  16. Longley, J.R.: The sequentially realizable functionals. Annals of Pure and Applied Logic 117(1-3), 1–93 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  17. Melliès, P.-A.: Sequential algorithms and strongly stable functions. To appear in the special issue of TCS: Game Theory Meets Theoretical Computer Science (2003)

    Google Scholar 

  18. Melliès, P.-A.: Comparing hierarchies of types in models of linear logic. Information and Computation 189(2), 202–234 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Selinger, P.: Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science 11, 207–260 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. van Oosten, J.: A combinatory algebra for sequential functionals of finite type. Technical Report 996, University of Utrecht (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de mathématiques de Luminy UMR 6206, campus de Luminy case 907, 13288, Marseille cedex 9, France

    Pierre Boudes

Authors
  1. Pierre Boudes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, 240 Jordi Girona Salgado, 1-3 E-08034, Barcelona

    Josep Díaz

  2. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  4. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudes, P. (2004). Projecting Games on Hypercoherences. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27836-8_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22849-3

  • Online ISBN: 978-3-540-27836-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation