International audienceWe propose an alternative approach, based on diagram rewriting, for computations in bialgebras. We illustrate this graphical syntax by proving some properties of co-operations, including coassociativity and cocommutativity. This amounts to checking the confluence of some rewriting systems
We give a survey of a diagrammatic syntax for PROs and PROPs, which are related to the theory of bia...
International audienceWe give a survey of a diagrammatic syntax for PROs and PROPs, which are relate...
The work was started while the second author was invited at LIX, Ecole Polytechnique, by Ecole Polyt...
We propose an alternative approach of computations in bialgebras, based on diagram rewriting. We ill...
Symmetric monoidal categories have become ubiquitous as a formal environment for the analysis of com...
. We present a canonical system for comonads which can be extended to the notion of a computational ...
Turi and Plotkin’s bialgebraic semantics is an abstract approach to specifying the operational seman...
A foundational theory of compositional categorical rewriting theory is presented, based on a collect...
We present a formal notion of diagram that captures standard rewriting properties such as conuence, ...
We present a formal notion of diagram that captures standard rewriting properties such as confluence...
Diagrams are in common use in the rewriting community. In this paper, we present a formalization of ...
Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational seman...
String diagrams are a powerful and intuitive graphical syntax, originating in theoretical physics an...
International audienceThis paper builds on a fundamental notion of rewriting theory that characteriz...
We give a survey of a diagrammatic syntax for PROs and PROPs, which are related to the theory of bia...
International audienceWe give a survey of a diagrammatic syntax for PROs and PROPs, which are relate...
The work was started while the second author was invited at LIX, Ecole Polytechnique, by Ecole Polyt...
We propose an alternative approach of computations in bialgebras, based on diagram rewriting. We ill...
Symmetric monoidal categories have become ubiquitous as a formal environment for the analysis of com...
. We present a canonical system for comonads which can be extended to the notion of a computational ...
Turi and Plotkin’s bialgebraic semantics is an abstract approach to specifying the operational seman...
A foundational theory of compositional categorical rewriting theory is presented, based on a collect...
We present a formal notion of diagram that captures standard rewriting properties such as conuence, ...
We present a formal notion of diagram that captures standard rewriting properties such as confluence...
Diagrams are in common use in the rewriting community. In this paper, we present a formalization of ...
Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational seman...
String diagrams are a powerful and intuitive graphical syntax, originating in theoretical physics an...
International audienceThis paper builds on a fundamental notion of rewriting theory that characteriz...
We give a survey of a diagrammatic syntax for PROs and PROPs, which are related to the theory of bia...
International audienceWe give a survey of a diagrammatic syntax for PROs and PROPs, which are relate...
The work was started while the second author was invited at LIX, Ecole Polytechnique, by Ecole Polyt...
DOI
Add to ORKG