{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T08:15:02Z","timestamp":1761725702043,"version":"build-2065373602"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,8,21]]},"abstract":"<jats:p>Two families of denotational models have emerged from the semantic analysis of linear logic: dynamic models, typically presented as game semantics, and static models, typically based on a category of relations. In this paper we introduce a formal bridge between a dynamic model and a static model: the model of thin concurrent games and strategies, based on event structures, and the model of generalized species of structures, based on distributors. A special focus of this paper is the two-dimensional nature of the dynamic-static relationship, which we formalize with double categories and bicategories.  In the first part of the paper, we construct a symmetric monoidal oplax functor from linear concurrent strategies to distributors. We highlight two fundamental differences between the two models: the composition mechanism, and the representation of resource symmetries. In the second part of the paper, we adapt established methods from game semantics (visible strategies, payoff structure) to enforce a tighter connection between the two models. We obtain a cartesian closed pseudofunctor, which we exploit to shed new light on recent results in the theory of the lambda-calculus.<\/jats:p>","DOI":"10.46298\/lmcs-21(4:12)2025","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T01:10:06Z","timestamp":1761700206000},"source":"Crossref","is-referenced-by-count":0,"title":["From Thin Concurrent Games to Generalized Species of Structures (Extended Version)"],"prefix":"10.46298","volume":"Volume 21, Issue 4","author":[{"given":"Pierre","family":"Clairambault","sequence":"first","affiliation":[]},{"given":"Federico","family":"Olimpieri","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Paquet","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2025,10,28]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2302.01082v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2302.01082v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T01:10:06Z","timestamp":1761700206000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/13966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-21(4:12)2025","relation":{"has-preprint":[{"id-type":"arxiv","id":"2302.01082v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2302.01082v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2302.01082","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2302.01082","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,28]]},"article-number":"13966"}}