Asynchronous games 2: The true concurrency of innocence-Reference-Cited by-同舟云学术

Asynchronous games 2: The true concurrency of innocence

Published:2006-08 Issue:2-3 Volume:358 Page:200-228
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Melliès Paul-André

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference40 articles.

1. Sequentiality vs. concurrency in games and logic;Abramsky;Math. Structures Comput. Sci.,2003

2. Full abstraction for PCF;Abramsky;Inform. and Comput.,2000

3. Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions;Abramsky,1997

4. Game semantics;Abramsky,1999

5. S. Abramsky, P.-A. Melliès, Concurrent games and full completeness, in: Proc. Fourteenth Annu. Symp. Logic in Computer Science, LiCS 1999, Trento, IEEE Computer Society Press, Silver Spring, MD, July 1999, pp. 431–442.

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

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

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. Asynchronous Template Games and the Gray Tensor Product of 2-Categories;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

5. Monoidal-closed categories of tree automata;Mathematical Structures in Computer Science;2020-01