Theoretical Computer Science
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical Computer Science
Information and Computation
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Discreet Games, Light Affine Logic and PTIME Computation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Stratified coherence spaces: a denotational semantics for light linear logic
Theoretical Computer Science - Implicit computational complexity
Realizability models for BLL-like languages
Theoretical Computer Science - Implicit computational complexity
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Quantitative models and implicit complexity
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We give a categorical interpretation of Lafont's Soft Linear Logic, a logical system complete for polynomial time computation, in terms of multiplexor categories. We present two main classes of models and methods for constructing examples in each case. As a concrete example of the first type, we introduce a simple game semantics for Multiplicative Soft Linear Logic. To illustrate the second type, we give a realizability model and a new proof of the polytime soundness of Soft Linear Logic. These results further our semantic understanding of Soft Linear Logic and polynomial time.