Rewriting modulo symmetric monoidal structure
暂无分享,去创建一个
Fabio Gadducci | Aleks Kissinger | Filippo Bonchi | Pawel Sobocinski | Fabio Zanasi | F. Gadducci | A. Kissinger | F. Bonchi | P. Sobocinski | F. Zanasi
[1] Fabio Zanasi,et al. Interacting Hopf Algebras: the theory of linear systems , 2018, ArXiv.
[2] P. Selinger. A Survey of Graphical Languages for Monoidal Categories , 2009, 0908.3347.
[3] Nicoletta Sabadini,et al. GENERIC COMMUTATIVE SEPARABLE ALGEBRAS AND COSPANS OF GRAPHS , 2005 .
[4] Samuel Mimram,et al. Towards 3-Dimensional Rewriting Theory , 2014, Log. Methods Comput. Sci..
[5] Brendan Fong. A Compositional Framework for Passive Linear Circuits , 2015 .
[6] Filippo Bonchi,et al. A Categorical Semantics of Signal Flow Graphs , 2014, CONCUR.
[7] Dominic R. Verity,et al. Traced monoidal categories , 1996, Mathematical Proceedings of the Cambridge Philosophical Society.
[8] Yves Guiraud,et al. Termination orders for 3-dimensional rewriting , 2006, ArXiv.
[9] Roberto Bruni,et al. A Connector Algebra for P/T Nets Interactions , 2011, CONCUR.
[10] Laura Scull,et al. Amalgamations of Categories , 2009, Canadian Mathematical Bulletin.
[11] Nicolai Reshetikhin,et al. Quantum Groups , 1993 .
[12] Ross Street,et al. Limits indexed by category-valued 2-functors , 1976 .
[13] Filippo Bonchi,et al. Interacting Hopf Algebras , 2014, ArXiv.
[14] Aleks Kissinger,et al. Quantomatic: A proof assistant for diagrammatic reasoning , 2015, CADE.
[15] Aleks Kissinger,et al. Strong Complementarity and Non-locality in Categorical Quantum Mechanics , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.
[16] Filippo Bonchi,et al. Full Abstraction for Signal Flow Graphs , 2015, POPL.
[17] Fabio Gadducci,et al. An inductive view of graph transformation , 1997, WADT.
[18] G. M. Kelly,et al. Coherence for compact closed categories , 1980 .
[19] Hartmut Ehrig,et al. Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting , 2004, FoSSaCS.
[20] Hartmut Ehrig,et al. Parallelism of Manipulations in Multidimensional Information Structures , 1976, MFCS.
[21] Roberto Bruni,et al. A basic algebra of stateless connectors , 2006, Theor. Comput. Sci..
[22] José Meseguer,et al. Petri Nets Are Monoids , 1990, Inf. Comput..
[23] John C. Baez,et al. Categories in Control , 2014, 1405.6881.
[24] Detlef Plump,et al. Hypergraph rewriting: critical pairs and undecidability of confluence , 1993 .
[25] M. J. Plasmeijer,et al. Term graph rewriting: theory and practice , 1993 .
[26] Pawel Sobocinski,et al. A Programming Language for Spatial Distribution of Net Systems , 2014, Petri Nets.
[27] Jan Willem Klop,et al. Term Graph Rewriting , 1995, HOA.
[28] Vladimiro Sassone,et al. Reactive systems over cospans , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[29] A. Joyal,et al. The geometry of tensor calculus, I , 1991 .
[30] Paolo Rapisarda,et al. A categorical approach to open and interconnected dynamical systems , 2015, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[31] S. Maclane,et al. Categorical Algebra , 2007 .
[32] Pawel Sobocinski,et al. Adhesive and quasiadhesive categories , 2005, RAIRO Theor. Informatics Appl..
[33] Peter Selinger,et al. Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract) , 2007, QPL.
[34] Aleks Kissinger,et al. Open-graphs and monoidal theories† , 2010, Mathematical Structures in Computer Science.
[35] Fabio Gadducci,et al. An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories , 1999, Appl. Categorical Struct..
[36] Julian Rathke,et al. Compositional Reachability in Petri Nets , 2014, RP.
[37] John Power,et al. The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads , 2007, Computation, Meaning, and Logic.
[38] A. Carboni,et al. Matrices, relations, and group representations , 1991 .
[39] Bob Coecke,et al. Interacting Quantum Observables , 2008, ICALP.
[40] Yves Lafont,et al. Towards an algebraic theory of Boolean circuits , 2003 .
[41] Albert Burroni,et al. Higher-Dimensional Word Problems with Applications to Equational Logic , 1993, Theor. Comput. Sci..
[42] T. V. H. Prathamesh. Tensor Product of Matrices , 2016, Arch. Formal Proofs.