This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky, R. Jagadeesan, P. Malacaria: Full abstraction for PCF, (submitted for publication, 1996)
S. Abramsky: Retracing some paths in process algebra, Springer Lecture Notes in Computer Science 1119, 1–17, 1996
S. Abramsky, G. McCusker: Linearity, Sharing and State, In Algol-like languages, ed. P.O'Hearn and R.D. Tennent, 317–348, Birkhauser, 1997
S. Abramsky, G. McCusker: Full Abstraction for Idealized Algol with Passive Expressions, (submitted for publication, 1997)
S. Abramsky, G. McCusker: Call-by-value games (submitted for publication, 1997)
K. Honda, N. Yoshida: Game-theoretic analysis of call-by-value computation To appear in Proceedings of ICALP'97
K. Hyland and C.H.L. Ong: On full abstraction for PCF (submitted for publication, 1996)
J.Laird: Full abstraction for functional languages with control, To appear in Proceedings of LiCS'97
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abramsky, S. (1997). Game semantics for programming languages. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029944
Download citation
DOI: https://doi.org/10.1007/BFb0029944
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive