Abstract
The aim of this chapter is to give an introduction to some recent work on the application of game semantics to the study of programming languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Accepted for publication in Information and Computation, 1997.
S. Abramsky. Retracing some paths in process algebra. InCONCUR 96: Con-currency Theory Seventh International Conferencenumber 1119 in Lecture Notes in Computer Science, pages 1–17. Springer-Verlag, 1996.
S. Abramsky. Axioms for full abstraction and full completeness. In G. Plotkin, C. Sterling, and M. Tolle, editorsEssays in Honour of Robin Milner.MIT Press, to appear.
S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. InProceedings Thirteenth Annual IEEE Symposium on Logic in Computer Science pages 334–344. IEEE Computer Society Press, 1998.
S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic.Journal of Symbolic Logic59(2):543 - 574, June 1994. Also appeared as Technical Report 92/24 of the Department of Computing, Imperial College of Science, Technology and Medicine.
S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In O’Hearn and Tennent [30], pages 297–329 of volume 2.
S. Abramsky and G. McCusker. Call-by-value games. In M. Nielsen and W. Thomas, editorsComputer Science Logic: 11th International Workshop ProceedingsLecture Notes in Computer Science, pages 1–17. Springer-Verlag, 1998.
S. Abramsky and G. McCusker. Full abstraction for Idealized Algol with passive expressions. To appear in Theoretical Computer Science, 1998.
G. Berry and P.-L. Curien. Sequential algorithms on concrete data structures.Theoretical Computer Science20:265–321, 1982.
F. Borceux.Handbook of Categorical Algebra volume 1. Cambridge University Press, 1994.
R. Cartwright, P.-L. Curien, and M. Felleisen. Fully abstract semantics for observably sequential languages.Information and Computation111(2):297–401, 1994.
J.-Y. Girard. Linear Logic.Theoretical Computer Science50(1):1–102, 1987.
C. A. Gunter.Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. MIT Press, 1992.
C. A. R. Hoare.Communicating Sequential Processes.Prentice-Hall, 1985.
K. Honda and N. Yoshida. Game theoretic analysis of call-by-value computation. In P. Degano, R. Gorrieri, and A. Marchietti-Spaccamela, editorsProceedings 25th International Colloquium on Automata Languages and Programming: ICALP ‘87volume 1256 of Lecture Notes in Computer Sciencepages 225–236. Springer-Verlag, 1997.
J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. Accepted for publication in Information and Computation, 1997.
R. Kelsey, W. Clinger, and J. Rees. The revised5report on the algorithmic language Scheme. 1998.
S. C. Kleene. Recursive functionals and quantifiers of finite types revisited I. In J. E. Fenstad, R. O. Gandy, and G. E. Sacks, editorsGeneralized Recursion Theory IIpages 185–222. North-Holland, Amsterdam, 1978.
S. C. Kleene. Recursive functionals and quantifiers of finite types revisited II. In J. Barwise, H. J. Keisler, and K. Kunen, editorsThe Kleene Symposiumpages 1–29. North-Holland, Amsterdam, 1980.
S. C. Kleene. Recursive functionals and quantifiers of finite types revisited III. In G. Metakides, editorPatras Logic Symposiumpages 1–40. North-Holland, Amsterdam, 1982.
S. C. Kleene. Unimonotone functions of finite types (recursive functionals and quantifiers of finite types revisited IV). In A. Nerode and R. A. Shore, editorsRecursion Theorypages 119–138. American Mathematical Society, Providence, Rhode Island, 1985.
J. Laird. Full abstraction for functional languages with control. InProceedings Twelfth Annual IEEE Symposium on Logic in Computer Sciencepages 58–67. IEEE Computer Society Press, 1997.
R. Loader. Finitary PCF is not decidable. Unpublished manuscript, 1996.
G. McCusker. Games and full abstraction for FPC (full version). Submitted for publication, 1996.
G. McCusker.Games and Full Abstraction for a Functional Metalanguage with Recursive Types.Distinguished Dissertations in Computer Science. Springer-Verlag, 1998.
R. Milner.Communication and Concurrency.Prentice Hall, 1989.
R. Milner. Functions as processes. InProceedings of ICALP 90volume 443 ofLecture Notes in Computer Sciencepages 167–180. Springer-Verlag, 1990.
R. Milner, M. Tofte, and R. W. Harper.The Definition of Standard ML. MIT Press, Cambridge, Massachusetts, 1990.
H. Nickau. Hereditarily sequential functionals. InProceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. PetersburgLecture notes in Computer Science. Springer, 1994.
P. W. O’Hearn and R. D. Tennent, editors.Algol-like Languages.Birkhaiiser, 1997.
G. Plotkin. LCF considered as a programming language.Theoretical Computer Science5:223–255, 1977.
J. C. Reynolds. The essence of Algol. InProceedings of the 1981 International Symposium on Algorithmic Languagespages 345–372. North-Holland, 1981.
G. Winskel.The Formal Semantics of Programming Languages.Foundations of Computing. The MIT Press, Cambridge, Massachusetts, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abramsky, S., McCusker, G. (1999). Game Semantics. In: Berger, U., Schwichtenberg, H. (eds) Computational Logic. NATO ASI Series, vol 165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58622-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-58622-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63670-7
Online ISBN: 978-3-642-58622-4
eBook Packages: Springer Book Archive