Timeless games-Reference-Cited by-同舟云学术

Timeless games

Published:1998 Issue: Volume: Page:56-77
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Baillot Patrick,Danos Vincent,Ehrhard Thomas,Regnier Laurent

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0028007

Reference11 articles.

1. Samson Abramsky and Radha Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59:543–574, 1994.

2. Lecture Notes in Computer Science;S. Abramsky,1994

3. Samson Abramsky, Radha Jagadeesan, and Pasquale Malacaria. Full abstraction for PCF (submitted for publication. available by ftp on theory.doc.ic.ac.uk, November 1995.

4. Patrick Baillot, Vincent Danos, Thomas Ehrhard, and Laurent Regnier. Believe it or not, AJM's games model is a model of classical linear logic. In Proceedings of the 12 th Symposium on Logic in Computer Science, Warsaw, 1997. IEEE Computer Society Press.

5. Pierre-Louis Curien and Hugo Herbelin. Computing with abstract Böhm trees. Manuscript, 1996.

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

1. Effectful semantics in bicategories: strong, commutative, and concurrent pseudomonads;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. The Cartesian Closed Bicategory of Thin Spans of Groupoids;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. From Thin Concurrent Games to Generalized Species of Structures;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

4. Full abstraction for the quantum lambda-calculus;Proceedings of the ACM on Programming Languages;2020-01

5. A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus;Lecture Notes in Computer Science;2017