Completeness of Nominal PROPs

DOI10.46298/lmcs-19(1:8)2023OpenAlexW3017316050MaRDI QIDQ5883754

Samuel Balco, Alexander Kurz

Publication date: 22 March 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.08380v5

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• The calculus of signal flow diagrams. I: Linear relations on streams.
• The geometry of tensor calculus. I
• Braided tensor categories
• Towards an algebraic theory of Boolean circuits.
• Classical roots of knot theory
• Causal inference by string diagram surgery
• Pure bigraphs: structure and dynamics
• On the category of props
• Full Abstraction for Signal Flow Graphs
• Nominal Sets
• Automata theory in nominal sets
• A Program Construction and Verification Tool for Separation Logic
• Multi-type display calculus for dynamic epistemic logic
• Picturing Quantum Processes
• A Survey of Graphical Languages for Monoidal Categories
• Stone Duality for Nominal Boolean Algebras with И
• The semantics of BI and resource tableaux
• Functorial Boxes in String Diagrams
• Nominal Domain Theory for Concurrency
• Nominal (Universal) Algebra: Equational Logic with Names and Binding
• Topology and logic as a source of algebra
• Adjointness in Foundations
• The Logic of Bunched Implications
• Rewriting modulo symmetric monoidal structure
• The Logical Essentials of Bayesian Reasoning
• Coherent Presentations of Monoidal Categories
• Learning nominal automata
• Denotational Semantics with Nominal Scott Domains
• Foundations of Software Science and Computational Structures

This page was built for publication: Completeness of Nominal PROPs