Introduction to higher order categorical logic
Introduction to higher order categorical logic
Theoretical Computer Science
A characterisation of the least-fixed-point operator by dinaturality
Theoretical Computer Science
New foundations for the geometry of interaction
Information and Computation
Network Algebra
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Uncertain Programming
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Retracting Some Paths in Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Glueing and orthogonality for models of linear logic
Theoretical Computer Science - Category theory and computer science
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
A categorical model for the geometry of interaction
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Algebraic fusion of functions with an accumulating parameter and its improvement
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Dagger Compact Closed Categories and Completely Positive Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
Resource modalities in game semantics
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
An Algebraic Account of References in Game Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantum circuit oracles for Abstract Machine computations
Theoretical Computer Science
Towards a typed geometry of interaction
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
A modified GoI interpretation for a linear functional programming language and its adequacy
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Functional programming in sublinear space
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Computation-by-Interaction with effects
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
| Hi-index | 0.00 |
The structure theorem of Joyal, Street and Verity says that every traced monoidal category arises as a monoidal full subcategory of the tortile monoidal category Int. In this paper we focus on a simple observation that a traced monoidal category is closed if and only if the canonical inclusion from into Int has a right adjoint. Thus, every traced monoidal closed category arises as a monoidal co-reflexive full subcategory of a tortile monoidal category. From this, we derive a series of facts for traced models of linear logic, and some for models of fixed-point computation. To make the paper more self-contained, we also include various background results for traced monoidal categories.