Resource modalities in tensor logic

DOI10.1016/J.APAL.2009.07.018MaRDI QIDQ636303zbMATH OpenOpenAlexFDO

Authors Paul-André Melliès, Nicolas Tabareau

Publication date 26 August 2011

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2009.07.018

zbMATH Keywords

categorical semanticsgame semanticslinear logicConway gamesresource modalitiestensor logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Categorical semantics of formal languages (18C50)

Recommendations

• Some semantical aspects of linear logic
• Resource sharing linear logic
• A micrological study of negation
• scientific article; zbMATH DE number 1678395
• A game semantics for linear logic

Cites work

• scientific article; zbMATH DE number 3677798 (Why is no real title available?)
• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 1231584 (Why is no real title available?)
• scientific article; zbMATH DE number 1259144 (Why is no real title available?)
• scientific article; zbMATH DE number 2079022 (Why is no real title available?)
• scientific article; zbMATH DE number 3296291 (Why is no real title available?)
• scientific article; zbMATH DE number 3190338 (Why is no real title available?)
• A game semantics for linear logic
• A new constructive logic: classic logic
• An Explicit Formula for the Free Exponential Modality of Linear Logic
• Asynchronous games 3 an innocent model of linear logic
• CONCUR 2004 - Concurrency Theory
• Coherence for compact closed categories
• Completeness of continuation models for \(\lambda_\mu\)-calculus
• Control categories and duality: On the categorical semantics of the lambda-mu calculus
• Degrees of indeterminacy of games
• Finiteness spaces
• Full abstraction for PCF
• Functorial Boxes in String Diagrams
• Games and full completeness for multiplicative linear logic
• Interactive models of computation and program behavior
• Linear logic
• Logic Programming with Focusing Proofs in Linear Logic
• Notions of computation and monads
• On Double Dualization Monads.
• On full abstraction for PCF: I, II and III
• Polarized category theory, modules, and game semantics
• Premonoidal categories and notions of computation
• Pseudo-commutative monads and pseudo-closed 2-categories
• Semantics of weakening and contraction
• Sequential algorithms on concrete data structures
• Sequentiality vs. concurrency in games and logic

Cited in

(16)

• A tale of additives and concurrency in game semantics
• From focalization of logic to the logic of focalization
• An axiomatic account of a fully abstract game semantics for general references
• Ribbon tensorial logic
• Models of Linear Logic based on the Schwartz $\varepsilon$-product
• A micrological study of negation
• Imperative programs as proofs via game semantics
• Non-linearity as the metric completion of linearity
• On the meaning of focalization
• Multiple conclusion linear logic: cut elimination and more
• Classical realizability in the CPS target language
• Linear \(\lambda \mu\) is CP (more or less)
• N.A. Vasil'ev's logical ideas and the categorical semantics of many-valued logic
• scientific article; zbMATH DE number 7450001 (Why is no real title available?)
• Disentangling parallelism and interference in game semantics
• The parametric continuation monad

This page was built for publication: Resource modalities in tensor logic

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