Believe it or not, AJM's games model is a model of classical linear logic

Authors:
P. Baillot;V. Danos;T. Ehrhard;L. Regnier
Affiliations:
-;-;-;-
Venue:
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Year:
1997

Citing 0
Cited 10

Program analysis games

ACM Computing Surveys (CSUR)
Classical isomorphisms of types

Mathematical Structures in Computer Science
Game Semantics for Access Control

Electronic Notes in Theoretical Computer Science (ENTCS)
A--maze--ing Esterel

Electronic Notes in Theoretical Computer Science (ENTCS)
Subtyping recursive games

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Playing logic programs with the alpha-beta algorithm

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Understanding Game Semantics Through Coherence Spaces

Electronic Notes in Theoretical Computer Science (ENTCS)
Constructive semantics for instantaneous reactions

Theoretical Computer Science
Musings around the geometry of interaction, and coherence

Theoretical Computer Science
Constructing differential categories and deconstructing categories of games

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general category of games is constructed. A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical linear logic.