Traced monoidal categories
From MaRDI portal
Publication:4877674
DOI10.1017/S0305004100074338zbMath0845.18005OpenAlexW2102357532WikidataQ56687269 ScholiaQ56687269MaRDI QIDQ4877674
Dominic Verity, André Joyal, Ross H. Street
Publication date: 3 September 1996
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0305004100074338
Related Items
A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces ⋮ Resource convertibility and ordered commutative monoids ⋮ On the wheeled PROP of stable cohomology of \(\mathrm{Aut}(F_n)\) with bivariant coefficients ⋮ Monoidal Categories, 2-Traces, and Cyclic Cohomology ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Representation of partial traces ⋮ Two-dimensional algebra in lattice gauge theory ⋮ Unnamed Item ⋮ Proofs as Polynomials ⋮ Bases in Diagrammatic Quantum Protocols ⋮ Two applications of analytic functors ⋮ An Explicit Framework for Interaction Nets ⋮ Inversion, Iteration, and the Art of Dual Wielding ⋮ A non-unital generalized trace and linear complex structures ⋮ Toward the group completion of the Burau representation ⋮ String diagram rewrite theory III: Confluence with and without Frobenius ⋮ Computation by interaction for space-bounded functional programming ⋮ Semantics of value recursion for Monadic Input/Output ⋮ Feedback, trace and fixed-point semantics ⋮ Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ A categorical foundation for structured reversible flowchart languages ⋮ From global to local state, coalgebraically and compositionally ⋮ Weakest preconditions in fibrations ⋮ Parametrized fixed points and their applications to session types ⋮ Partial traces on additive categories ⋮ From reversible programming languages to reversible metalanguages ⋮ Geometry of Synthesis II: From Games to Delay-Insensitive Circuits ⋮ Bialgebras in Rel ⋮ Timed Sets, Functional Complexity, and Computability ⋮ A Representation Theorem for Unique Decomposition Categories ⋮ String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ A quantum double construction in Rel ⋮ A Term-Graph Syntax for Algebras over Multisets ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ From Coalgebraic to Monoidal Traces ⋮ Semantics of higher-order quantum computation via geometry of interaction ⋮ The geometry of Bayesian programming ⋮ Tensor topology ⋮ A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). ⋮ A practical type theory for symmetric monoidal categories ⋮ Shadows and traces in bicategories ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ String diagrams for traced and compact categories are oriented 1-cobordisms ⋮ Towards Quantum Field Theory in Categorical Quantum Mechanics ⋮ Traces in symmetric monoidal categories ⋮ Simple free star-autonomous categories and full coherence ⋮ Drags: a compositional algebraic framework for graph rewriting ⋮ Calculating Colimits Compositionally ⋮ Partially traced categories ⋮ Semisimplicity in symmetric rigid tensor categories ⋮ Monoidal indeterminates and categories of possible worlds ⋮ Sheaf representation of monoidal categories ⋮ Attribute Grammars and Categorical Semantics ⋮ Unnamed Item ⋮ Coherence for invertible objects and multigraded homotopy rings ⋮ Unnamed Item ⋮ Petri nets are dioids: a new algebraic foundation for non-deterministic net theory ⋮ Unnamed Item ⋮ A specification structure for deadlock-freedom of synchronous processes ⋮ A Hoare logic for linear systems ⋮ Generalized counting constraint satisfaction problems with determinantal circuits ⋮ Traces in monoidal derivators, and homotopy colimits ⋮ Can a Quantum Computer Run the von Neumann Architecture? ⋮ A string diagrammatic axiomatisation of finite-state automata ⋮ Traces for coalgebraic components ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ The compositional construction of Markov processes II ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ Join inverse categories and reversible recursion ⋮ Towards a typed Geometry of Interaction ⋮ Perverse sheaves and knot contact homology ⋮ Machine semantics ⋮ Quantum circuit oracles for abstract machine computations ⋮ The monoidal structure of Turing machines ⋮ Towards Hilbert's 24th Problem: Combinatorial Proof Invariants ⋮ Musings around the geometry of interaction, and coherence ⋮ Towards a geometry of recursion ⋮ Categorical rewriting of term-like structures ⋮ Linear realizability and full completeness for typed lambda-calculi ⋮ Random quantum channels. I: Graphical calculus and the Bell state phenomenon ⋮ A categorical foundation for structured reversible flowchart languages: Soundness and adequacy ⋮ Unnamed Item ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Composing dinatural transformations: towards a calculus of substitution ⋮ The calculus of signal flow diagrams. I: Linear relations on streams. ⋮ Circuit algebras are wheeled props ⋮ Schur-Finiteness and Endomorphisms Universally of Trace Zero Via Certain Trace Relations ⋮ Monoidal Indeterminates and Categories of Possible Worlds ⋮ An Algebraic Account of References in Game Semantics ⋮ On geometry of interaction for polarized linear logic ⋮ On traced monoidal closed categories ⋮ Join Inverse Categories as Models of Reversible Recursion ⋮ Weakest preconditions in fibrations ⋮ Dynamical systems and sheaves ⋮ Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract) ⋮ Traced Premonoidal Categories ⋮ An Australian Conspectus of Higher Categories ⋮ A note on the biadjunction between 2-categories of traced monoidal categories and tortile monoidal categories ⋮ Concurrent Quantum Strategies ⋮ A categorical framework for typing CCS-style process communication ⋮ Traces in monoidal categories ⋮ Physical Traces ⋮ GS·Λ Theories ⋮ The Uniformity Principle on Traced Monoidal Categories ⋮ A Categorical Semantics of Higher Order Store ⋮ A MALL geometry of interaction based on indexed linear logic ⋮ Feedback for linearly distributive categories: Traces and fixpoints ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ A structural approach to reversible computation ⋮ Aspects of Categorical Recursion Theory ⋮ Event Domains, Stable Functions and Proof-Nets ⋮ Conformal Field Theory as a Nuclear Functor ⋮ De-linearizing Linearity: Projective Quantum Axiomatics From Strong Compact Closure ⋮ Axiomatic Description of Mixed States From Selinger's CPM-construction ⋮ POVMs and Naimark's Theorem Without Sums ⋮ A categorical model for the geometry of interaction
Cites Work
- Tortile Yang-Baxter operators in tensor categories
- Coherence for compact closed categories
- The geometry of tensor calculus. I
- Coherence theorems via knot theory
- Iteration theories of synchronization trees
- Braided tensor categories
- Modulated bicategories
- Ribbon graphs and their invariants derived from quantum groups
- Braided compact closed categories with applications to low dimensional topology
This page was built for publication: Traced monoidal categories
