Asynchronous games 3 an innocent model of linear logic

MaRDI QIDQ2849884zbMATH OpenFDO

Authors Paul-André Melliès

Publication date 20 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105000381

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Categorical semantics of formal languages (18C50) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 1497810
• Focusing in asynchronous games
• Asynchronous Games: Innocence Without Alternation
• A parallel game semantics for linear logic
• A game semantics for linear logic

Cited in

(14)

• Linear logic in computer science
• Asynchronous games. II: The true concurrency of innocence
• Understanding game semantics through coherence spaces
• Bialgebras in Rel
• Realizability for Peano arithmetic with winning conditions in HON games
• Asynchronous Games: Innocence Without Alternation
• Focusing in asynchronous games
• scientific article; zbMATH DE number 1223612 (Why is no real title available?)
• scientific article; zbMATH DE number 1497810 (Why is no real title available?)
• An explicit formula for the free exponential modality of linear logic
• CONCUR 2004 - Concurrency Theory
• Resource modalities in tensor logic
• Asynchronous template games and the gray tensor product of 2-categories
• Template games and differential linear logic

This page was built for publication: Asynchronous games 3 an innocent model of linear logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849884)