Author:
Calderon Ana C.,McCusker Guy
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. Games and full completeness for multiplicative linear logic;Abramsky,1992
2. Full abstraction for PCF;Abramsky;Information and Computation,2000
3. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions (extended abstract);Abramsky;Electronic Notes in Theoretical Computer Science,1996
4. Timeless games;Baillot,1998
5. Baillot, P., V. Danos, T. Ehrhard and L. Regnierl, Believe it or not, ajm's games model is a model of classical linear logic, in: Twelfth Annual Symposium on Logic in Computer Science (1997), pp. 68–75.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Displayed Monoidal Categories for the Semantics of Linear Logic;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09
2. From Thin Concurrent Games to Generalized Species of Structures;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Grounding Game Semantics in Categorical Algebra;Electronic Proceedings in Theoretical Computer Science;2022-11-03
4. Layered and object-based game semantics;Proceedings of the ACM on Programming Languages;2022-01-12
5. Weighted models for higher-order computation;Information and Computation;2020-12