Game Semantics-Reference-Cited by-同舟云学术

Game Semantics

Published:1999 Issue: Volume: Page:1-55
ISSN:
Container-title:Computational Logic
language:
Short-container-title:

Author:

Abramsky Samson,McCusker Guy

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-58622-4_1

Reference33 articles.

1. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Accepted for publication in Information and Computation, 1997.

2. 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.

3. 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.

4. 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.

5. 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.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Compositional Theory of Linearizability;Journal of the ACM;2024-01-27

2. Game semantics of Martin-Löf type theory;Mathematical Structures in Computer Science;2023-07-31

3. A Compositional Theory of Linearizability;Proceedings of the ACM on Programming Languages;2023-01-09

4. The Far Side of the Cube;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023

5. Closing Bell Boxing Black Box Simulations in the Resource Theory of Contextuality;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023