Full Abstraction for Signal Flow Graphs

DOI10.1145/2676726.2676993zbMath1346.68143OpenAlexW2010590963MaRDI QIDQ2819836

Filippo Bonchi, Fabio Zanasi, Paweł Sobociński

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2676726.2676993

zbMATH Keywords

structural operational semanticsfull abstractionPROPssignal flow graphsstring diagrams

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Semantics in the theory of computing (68Q55)

Related Items

Completeness of Nominal PROPs ⋮ Generalized relations in linguistics \& cognition ⋮ Interacting Hopf algebras ⋮ Quantomatic: A Proof Assistant for Diagrammatic Reasoning ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ A Normal Form for Stateful Connectors ⋮ Equational Reasoning with Context-Free Families of String Diagrams ⋮ Unnamed Item ⋮ Contextual equivalence for signal flow graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Petri nets are dioids: a new algebraic foundation for non-deterministic net theory ⋮ Unnamed Item ⋮ Towards compositional graph theory ⋮ Confluence of Graph Rewriting with Interfaces ⋮ The algebra of partial equivalence relations ⋮ Lawvere Categories as Composed PROPs ⋮ Universal Constructions for (Co)Relations: categories, monoidal categories, and props ⋮ The calculus of signal flow diagrams. I: Linear relations on streams. ⋮ Graphical Conjunctive Queries. ⋮ Bialgebraic foundations for the operational semantics of string diagrams ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus} ⋮ Refinement for signal flow graphs ⋮ String diagram rewrite theory III: Confluence with and without Frobenius