Exhausting strategies, joker games and full completeness for IMLL with unit

Authors:
A. S. Murawski;C.-H. L. Ong
Affiliations:
Oxford University Computing Laboratory (OUCL), Wolfson Building, Parks Road, Oxford OX1 3QD, UK;Oxford University Computing Laboratory (OUCL), Wolfson Building, Parks Road, Oxford OX1 3QD, UK
Venue:
Theoretical Computer Science - Category theory and computer science
Year:
2003

Citing 5
Cited 2

Linear logic

Theoretical Computer Science
Games and full completeness for multiplicative linear logic

Journal of Symbolic Logic
On full abstraction for PCF: I, II, and III

Information and Computation
Full Completeness of the Multiplicative Linear Logic of Chu Spaces

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Dominator Trees and Fast Verification of Proof Nets

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Fast verification of MLL proof nets via IMLL

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a game description of free symmetric monoidal closed categories, which can also be viewed as a fully complete model for Intuitionistic multiplicative linear logic with the tensor unit. We model the unit by a distinguished one-move game called Joker. Special rules apply to the joker move. Proofs are modelled by what we call conditionally exhausting strategies, which are deterministic and total only at positions where no joker move exists in the immediate neighbourhood, and satisfy a kind of teachability condition called P-exhaustion. We use the model to give an analysis of a counting problem in free autonomous categories which generalizes the Triple Unit Problem.