50 citations · 180 across the 26 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2018
A Framework for Rewriting Families of String Diagrams
Vladimir Zamdzhiev
We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context…
cs.FL2017★ 1 cited
Rewriting Context-free Families of String Diagrams
Vladimir Nikolaev Zamdzhiev
String diagrams provide a convenient graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, rewritin…