Theoretical Computer Science
On the &pgr;-calculus and linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Proceedings of the workshop on Advances in linear logic
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Games Semantics for Full Propositional Linear Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Full Completeness of the Multiplicative Linear Logic of Chu Spaces
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Mechanizing proof theory: resource-aware logics and proof-transformations to extract implicit information
Implicit programming and the logic of constructible duality
Implicit programming and the logic of constructible duality
| Hi-index | 0.00 |
The essential interaction between classical and intuitionistic features in the system of linear logic is best described in the language of category theory. Given a symmetric monoidal closed category C with products, the category C × Cop can be given the structure of a *-autonomous category by a special case of the Chu construction. The main result of the paper is to show that the intuitionistic translations induced by Girard's trips determine the functor from the free *-autonomous category A on a set of atoms {P, P',...} to C × Cop, where C is the free monoidal closed category with products and coproducts on the set of atoms {PO, PI, P'O, P'I,... } (a pair PO, PI in C for each atom P of A).