Skip to main content
SpringerLink
Log in

An Axiomatic Account of a Fully Abstract Game Semantics for General References

  • Chapter
  • First Online:
Samson Abramsky on Logic and Structure in Computer Science and Beyond

Part of the book series: Outstanding Contributions to Logic ((OCTR,volume 25))

  • 181 Accesses

Abstract

We present an analysis of the game semantics of general references introduced by Abramsky, Honda and McCusker which exposes the algebraic structure of the model. Using the notion of sequoidal category, we give a coalgebraic definition of the denotational semantics of storage cells of arbitrary type. We identify further conditions on the model which allow an axiomatic presentation of the proof that finite elements of the model are definable by programs, in the style of Abramsky’s Axioms for Definability.

This paper is electronically published in Electronic Notes in Theoretical Computer Science URL: www.elsevier.nl/locate/entcs

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 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Abramsky, S. (2000). Axioms for definability and full completeness. In G. Plotkin, C. Sterling, & M. Tofte (Eds.), Essays in honour of robin milner (pp. 55–75). MIT Press.

    Google Scholar 

  • Abramsky, S., Honda, K., & McCusker, G. (1998). A fully abstract game semantics for general references. In Proceedings, Thirteenth Annual IEEE Symposium on Logic in Computer Science (pp. 334–344). IEEE Computer Society Press.

    Google Scholar 

  • Abramsky, S., & McCusker, G. (1996). Linearity, sharing and state: A fully abstract game semantics for Idealized Algol with active expressions (extended abstract). In Proceedings of 1996 Workshop on Linear Logic (Vol. 3, pp. 2–14). Electronic Notes in Theoretical Computer Science. Elsevier.

    Google Scholar 

  • Abramsky, S., & McCusker, G. (1997). Linearity, sharing and state: A fully abstract game semantics for Idealized Algol with active expressions. In P. W. O’Hearn, & R. D. Tennent (Eds.), Algol-like languages (Vol. 2, pp. 297–329). Birkhaüser.

    Google Scholar 

  • Abramsky, S., & McCusker, G. (1998). Call-by-value games. In M. Nielsen, & W. Thomas (Eds.), Computer Science Logic: 11th International Workshop Proceedings (pp. 1–17). Lecture notes in computer science. Berlin: Springer.

    Google Scholar 

  • Churchill, M., Laird, J., & McCusker, G. (2011). Imperative programs as proofs via game semantics. In 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 26th Annual IEEE Symposium on Logic in Computer Science, 21–24 June 2011 (pp. 65–74). Toronto, Ontario, Canada: IEEE Computer Society Press.

    Google Scholar 

  • Gowers, W. J., & Laird, J. (2017). Sequoidal categories and transfinite games: A coalgebraic approach to stateful objects in game semantics. In F. Bonchi, & B. König (Eds.), 7th Conference on Algebra and Coalgebra in Computer Science, CALCO 2017, 12–16 June 2017, Ljubljana, Slovenia (Vol. 72, pp. 13:1–13:17). LIPIcs. Schloss Dagstuhl—Leibniz-Zentrum für Informatik.

    Google Scholar 

  • Gurr, D. (1990). Semantic frameworks for complexity. Ph.D. thesis, University of Edinburgh.

    Google Scholar 

  • Harmer, R., & McCusker, G. (1999). A fully abstract game semantics for finite nondeterminism. In Proceedings, Fourteenth Annual IEEE Symposium on Logic in Computer Science (pp. 422–430).

    Google Scholar 

  • Honda, K., & Yoshida, N. (1997). Game theoretic analysis of call-by-value computation. In P. Degano, R. Gorrieri, & A. Marchietti-Spaccamela (Eds.), Proceedings, 25th International Colloquium on Automata, Languages and Programming: ICALP ’97 (Vol. 1256, pp. 225–236). Lecture notes in computer science. Berlin: Springer.

    Google Scholar 

  • Hyland, J. M. E., & Ong, C.-H.L. (2000). On full abstraction for PCF: I, II and III. Information and Computation, 162(2), 285–408.

    Article  Google Scholar 

  • Janelidze, G., & Kelly, G. M. (2001). A note on actions of a monoidal category. Theory and Applications of Categories [Electronic Only], 9, 61–91.

    Google Scholar 

  • Laird, J. (1997). Full abstraction for functional languages with control. In Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science (pp. 58–67). IEEE Computer Society Press.

    Google Scholar 

  • Laird, J. (2003). A categorical semantics of higher order store. In R. Blute, & P. Selinger (Eds.), Proceedings, 9th Conference on Category Theory and Computer Science, CTCS 2002. Electronic notes in theoretical computer science. Elsevier.

    Google Scholar 

  • Laird, J. (2019). From global to local state, coalgebraically and compositionally. In B. König (Ed.), Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, MFPS 2019, London, UK, 4–7 June 2019 (Vol. 347, pp. 203–222). Electronic Notes in Theoretical Computer Science. Elsevier.

    Google Scholar 

  • Melliès, P. A., & Tabareau, N. (2010). Resource modalities in tensor logic. Annals of Pure and Applied Logic, 161(5), 632–653. (The Third workshop on Games for Logic and Programming Languages (GaLoP)).

    Google Scholar 

  • Olivier, L. (2002). Étude de la polarisation en logique. Theses, Université de la Méditerranée—Aix-Marseille II March.

    Google Scholar 

  • Pitts, A. M. (1996). Relational properties of domains. Information and Computation, 127, 66–90.

    Article  Google Scholar 

  • Plotkin, G. (1977). LCF considered as a programming language. Theoretical Computer Science, 5, 223–255.

    Article  Google Scholar 

  • Reddy, U. S. (1993). A linear logic model of state. Technical report FP-1993-3, Department of Computer Science, University of Glasgow.

    Google Scholar 

  • Sakayori, K., & Tsukada, T. (2019). A categorical model of an i/o-typed \(\pi \)-calculus. In L. Caires (Ed.), Programming languages and systems (pp. 640–667), Cham: Springer International Publishing.

    Google Scholar 

  • Tzevelekos, N. (2009). Full abstraction for nominal general references. Logical Methods in Computer Science, 5(3).

    Google Scholar 

  • Wadler, P. (1990). Linear types can change the world! In M. Broy, & C. Jones (Edis.), Programming concepts and methods. IFIP TC2 Working Conference on Programming Concepts and Methods. North-Holland, Sea of Galilee, Israel.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bath, Bath, UK

    Jim Laird & Guy McCusker

Authors
  1. Jim Laird
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guy McCusker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guy McCusker .

Editor information

Editors and Affiliations

  1. Department of Ethics, Governance and Society, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands

    Alessandra Palmigiano

  2. Department of Computer Science, University College London, London, UK

    Mehrnoosh Sadrzadeh

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Laird, J., McCusker, G. (2023). An Axiomatic Account of a Fully Abstract Game Semantics for General References. In: Palmigiano, A., Sadrzadeh, M. (eds) Samson Abramsky on Logic and Structure in Computer Science and Beyond. Outstanding Contributions to Logic, vol 25. Springer, Cham. https://doi.org/10.1007/978-3-031-24117-8_7

Download citation

Publish with us

Policies and ethics

Search

Navigation