Resource modalities in tensor logic

DOI10.1016/j.apal.2009.07.018zbMath1223.03048OpenAlexW2078730256MaRDI QIDQ636303

Nicolas Tabareau, Paul-André Melliès

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

linear logicgame semanticscategorical semanticsConway gamesresource modalitiestensor logic

Mathematics Subject Classification ID

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

Related Items (11)

Models of Linear Logic based on the Schwartz $\varepsilon$-product ⋮ Multiple Conclusion Linear Logic: Cut Elimination and More ⋮ From Focalization of Logic to the Logic of Focalization ⋮ Non-linearity as the Metric Completion of Linearity ⋮ Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) ⋮ Imperative programs as proofs via game semantics ⋮ Unnamed Item ⋮ Classical realizability in the CPS target language ⋮ On the Meaning of Focalization ⋮ The parametric continuation monad ⋮ N.A. Vasil'ev's logical ideas and the categorical semantics of many-valued logic

Cites Work

• Linear logic
• Notions of computation and monads
• Coherence for compact closed categories
• Sequential algorithms on concrete data structures
• A game semantics for linear logic
• Semantics of weakening and contraction
• Pseudo-commutative monads and pseudo-closed 2-categories
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Completeness of continuation models for \(\lambda_\mu\)-calculus
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• Functorial Boxes in String Diagrams
• An Explicit Formula for the Free Exponential Modality of Linear Logic
• A new constructive logic: classic logic
• Logic Programming with Focusing Proofs in Linear Logic
• Games and full completeness for multiplicative linear logic
• Premonoidal categories and notions of computation
• Sequentiality vs. concurrency in games and logic
• CONCUR 2004 - Concurrency Theory
• On Double Dualization Monads.
• Degrees of indeterminacy of games
• Finiteness spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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