Advertisement

Game semantics for programming languages

  • Samson Abramsky
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1295)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AJM96]
    S. Abramsky, R. Jagadeesan, P. Malacaria: Full abstraction for PCF, (submitted for publication, 1996)Google Scholar
  2. [Abr96b]
    S. Abramsky: Retracing some paths in process algebra, Springer Lecture Notes in Computer Science 1119, 1–17, 1996Google Scholar
  3. [AM97a]
    S. Abramsky, G. McCusker: Linearity, Sharing and State, In Algol-like languages, ed. P.O'Hearn and R.D. Tennent, 317–348, Birkhauser, 1997Google Scholar
  4. [AM97b]
    S. Abramsky, G. McCusker: Full Abstraction for Idealized Algol with Passive Expressions, (submitted for publication, 1997)Google Scholar
  5. [AM97c]
    S. Abramsky, G. McCusker: Call-by-value games (submitted for publication, 1997)Google Scholar
  6. [HY97]
    K. Honda, N. Yoshida: Game-theoretic analysis of call-by-value computation To appear in Proceedings of ICALP'97Google Scholar
  7. [H096]
    K. Hyland and C.H.L. Ong: On full abstraction for PCF (submitted for publication, 1996)Google Scholar
  8. [Lai97]
    J.Laird: Full abstraction for functional languages with control, To appear in Proceedings of LiCS'97Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Samson Abramsky
    • 1
  1. 1.Laboratory for the Foundations of Computer ScienceUniversity of EdinburghUK

Personalised recommendations