Skip to main content Accessibility help
×
Home

On traced monoidal closed categories

  • MASAHITO HASEGAWA (a1)

Abstract

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.

Copyright

References

Hide All
Abramsky, S. (1996) Retracing some paths in process algebra. In: Proc. Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 1119 117.
Abramsky, S., Haghverdi, E. and Scott, P. J. (2002) Geometry of Interaction and linear combinatory algebras. Mathematical Structures in Computer Science 12 (5)625665.
Abramsky, S. and Jagadeesan, R. (1994) New foundations for the Geometry of Interaction. Inf. Comput. 111 (1)53119.
Barber, A. and Plotkin, G. (1997) Dual intuitionistic linear logic (manuscript). An earlier version available as Technical Report ECS-LFCS-96-347, LFCS, University of Edinburgh.
Barr, M. (1991) *-autonomous categories and linear logic. Mathematical Structures in Computer Science 1 159178.
Benton, N. (1995) A mixed linear non-linear logic: proofs, terms and models. In: Proc. Computer Science Logic. Springer-Verlag Lecture Notes in Computer Science 933 121135.
Bierman, G. M. (1995) What is a categorical model of intuitionistic linear logic? In: Proc. Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 902 7893.
Bloom, S. and Ésik, Z. (1993) Iteration Theories, EATCS Monographs on Theoretical Computer Science, Springer-Verlag.
Blute, R. F., Cockett, J. R. B. and Seely, R. A. G. (2000) Feedback for linearly distributive categories: traces and fixpoints. J. Pure Appl. Algebra 154 2769.
Chirica, L. M. and Martin, D. F. (1979) An order-algebraic definition of Knuthian semantics. Mathematical Systems Theory 13 127.
Coccia, M., Gadducci, F. and Montanari, U. (2002) GS-Λ theories: a syntax for higher-order graphs. In: Proc. Category Theory and Computer Science. Electronic Notes in Theoretical Computer Science 69.
Cockett, J. R. B. and Seely, R. A. G. (1999) Linearly distributive functors. J. Pure Appl. Algebra 143 155203.
Freedman, M. H., Kitaev, A. and Wang, Z. (2002) Simulation of topological field theories by quantum computers. Commun. Math. Phys. 227 587603.
Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50 1102.
Girard, J.-Y. (1989) Geometry of Interaction I: interpretation of system F. In: Proc. Logic Colloquium '88 221–260.
Haghverdi, E. (2000) A Categorical Approach to Linear Logic, Geometry of Interaction and Full Completeness, Ph.D. thesis, University of Ottawa.
Haghverdi, E. and Scott, P. J. (2006) A categorical model for the geometry of interaction. Theoretical Computer Science 350 (23) 252274.
Hasegawa, M. (1997) Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In: Proc. Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 1210 196213.
Hasegawa, M. (1999) Models of Sharing Graphs: A Categorical Semantics of let and letrec, Distinguished Dissertations Series, Springer-Verlag.
Hasegawa, M. (2000) A short proof of the uniqueness of trace on tortile categories (manuscript, available from the author's web page).
Hasegawa, M. (2004) The uniformity principle on traced monoidal categories. Publ. Res. Inst. Math. Sci. 40 (3)9911014.
Houston, R. (2008) Finite products are biproducts in a compact closed category. J. Pure Appl. Algebra 212 394400.
Hyland, M. and Schalk, A. (2003) Glueing and orthogonality for models of linear logic. Theoretical Computer Science 294 (12) 183231.
Joyal, A. and Street, R. (1991) The geometry of tensor calculus, I. Adv. Math. 88 55113.
Joyal, A. and Street, R. (1993) Braided tensor categories. Adv. Math. 102 2078.
Joyal, A., Street, R. and Verity, D. (1996) Traced monoidal categories. Math. Proc. Cambridge Phils. Soc. 119 447468.
Katsumata, S. (2008) Attribute grammars and categorical semantics. In: Proc. International Colloquium on Automata, Languages and Programming. Springer-Verlag Lecture Notes in Computer Science. 5126 271282.
Katsumata, S. and Nishimura, S. (2006) Algebraic fusion of functions with an accumulating parameter and its improvement. In: Proc. International Conference on Functional Programming 227–238.
Kelly, G. M. (1974) Doctrinal adjunction. In: Proc. Sydney Category Theory Seminar. Springer-Verlag Lecture Notes in Computer Science 420 257280.
Kelly, G. M. and Laplaza, M. L. (1980) Coherence for compact closed categories. J. Pure Appl. Algebra 19 193213.
Knuth, D. E. (1968) Semantics of context-free languages. Mathematical Systems Theory 2 (2)127145.
Lambek, J. and Scott, P. J. (1986) Introduction to Higher Order Categorical Logic, Cambridge University Press.
Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics 5, Springer-Verlag.
Melliès, P.-A. (2003) Categorical models of linear logic revisited. To appear in Theoretical Computer Science.
Melliès, P.-A. (2004) Asynchronous games 3: an innocent model of linear logic. In: Proc. Category Theory and Computer Science. Electronic Notes in Theoretical Computer Science 122 171192.
Melliès, P.-A. (2006) Functorial boxes in string diagrams. In: Proc. Computer Science Logic. Springer-Verlag Lecture Notes in Computer Science 4207 130.
Melliès, P.-A. and Tabareau, N. (2007) Resource modalities in game semantics. In: Proc. 22nd Logic in Computer Science 389–398.
Milner, R. (1994) Action calculi V: reflexive molecular forms (with appendix by O. Jensen). Manuscript, LFCS, University of Edinburgh.
Penrose, R. and Rindler, R. (1984) Spinors and Space-Time, Vol. 1, Cambridge University Press.
Seely, R. A. G. (1989) Linear logic, *-autonomous categories and cofree coalgebras. In: Categories in Computer Science. AMS Contemp. Math. 92 371389.
Selinger, P. (2007) Dagger compact closed categories and completely positive maps (extended abstract). In: Proc. International Workshop on Quantum Programming Languages. Electronic Notes in Theoretical Computer Science 170 139163.
Shum, M.-C. (1994) Tortile tensor categories. J. Pure Appl. Algebra 93 57110.
Simpson, A. (1993) A characterisation of the least-fixed-point operator by dinaturality. Theoretical Computer Science 118 (2)301314.
Simpson, A. and Plotkin, G. (2000) Complete axioms for categorical fixed-point operators. In: Proc. 15th Logic in Computer Science 30–41.
Ştefanescu, G. (2000) Network Algebra, Discrete Mathematics and Theoretical Computer Science Series, Springer-Verlag.
Yetter, D. N. (2001) Functorial Knot Theory, World Scientific.

On traced monoidal closed categories

  • MASAHITO HASEGAWA (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.