Author:
Abramsky Samson,Jagadeesan Radha
Abstract
AbstractWe present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates a natural notion of polarity, leading to a refined treatment of the additives. We make comparisons with related work by Joyal, Blass, et al.
Publisher
Cambridge University Press (CUP)
Reference41 articles.
1. Linear logic, *-autonomous categories and cofree coalgebras
2. LCF considered as a programming language
3. Remarques sur la theorie des jeux a deux personnes;Joyal;Gazette des sciences mathematiques du Quebec,1977
Cited by
222 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Using Z3 to Verify Inferences in Fragments of Linear Logic;Electronic Proceedings in Theoretical Computer Science;2023-09-22
2. Game semantics of Martin-Löf type theory;Mathematical Structures in Computer Science;2023-07-31
3. Lambek–Grishin Calculus: Focusing, Display and Full Polarization;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
4. Compositionality in Context;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
5. Duality, Intensionality, and Contextuality: Philosophy of Category Theory and the Categorical Unity of Science in Samson Abramsky;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023