From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/10456 Path: news.gmane.io!.POSTED.blaine.gmane.org!not-for-mail From: "Heckel, Reiko (Prof.)" Newsgroups: gmane.science.mathematics.categories Subject: FW: Invitation: GReTA online seminar, April 23 at 15:00 CET Date: Mon, 19 Apr 2021 07:43:44 +0000 Message-ID: Reply-To: "Heckel, Reiko (Prof.)" Content-Type: text/plain; charset="windows-1250" Content-Transfer-Encoding: quoted-printable Injection-Info: ciao.gmane.io; posting-host="blaine.gmane.org:116.202.254.214"; logging-data="23030"; mail-complaints-to="usenet@ciao.gmane.io" To: "categories@mta.ca" Original-X-From: majordomo@rr.mta.ca Wed Apr 21 18:10:54 2021 Return-path: Envelope-to: gsmc-categories@m.gmane-mx.org Original-Received: from smtp2.mta.ca ([198.164.44.75]) by ciao.gmane.io with esmtps (TLS1.2:ECDHE_RSA_AES_256_GCM_SHA384:256) (Exim 4.92) (envelope-from ) id 1lZFRG-0005sK-Dk for gsmc-categories@m.gmane-mx.org; Wed, 21 Apr 2021 18:10:54 +0200 Original-Received: from rr.mta.ca ([198.164.44.159]:53876) by smtp2.mta.ca with esmtp (Exim 4.80) (envelope-from ) id 1lZFPz-0006fA-R6; Wed, 21 Apr 2021 13:09:35 -0300 Original-Received: from majordomo by rr.mta.ca with local (Exim 4.92.1) (envelope-from ) id 1lZFJi-0008Dd-7z for categories-list@rr.mta.ca; Wed, 21 Apr 2021 13:03:06 -0300 Accept-Language: en-GB, en-US Content-Language: en-GB Precedence: bulk Xref: news.gmane.io gmane.science.mathematics.categories:10456 Archived-At: Another interesting instalment of our favourite seminar =85 Looking forward to see you, Pawel! Reiko On 19/04/2021, 08:35, "GReTA Seminar organisers" wrote: Dear colleagues, It is our great pleasure to invite you to the next seminar of the =93GReTA = - Graph Transformation Theory and Applications=94 series: Friday, April 23, 15:00 CET =93Rewriting Modulo Symmetric Monoidal Structure=94, P. Soboci=F1ski (abstract and Zoom/YouTube links: see attached) The GReTA seminar series aims to serve as a platform for the international = graph rewriting community, to promote recent developments and trends in the= field, and to permit a regular networking and interaction between members = of this community. Seminars are scheduled twice a month (cf. https://www.ir= if.fr/~greta/#talks for a list of upc= oming events). With best regards, Nicolas Behr, Jean Krivine and Reiko Heckel (GReTA organisers) ___________________________________________________ Date and time: Friday, April 23, 15:00 CET Title: Rewriting Modulo Symmetric Monoidal Structure Speaker: Pawe=B3 Soboci=F1ski (Department of Computer Science, Tallinn Univ= ersity of Technology, Estonia) Abstract: String diagrams are an elegant, convenient and powerful syntax for arrows o= f symmetric monoidal categories. In recent years, they have been used as co= mpositional descriptions of computational systems from various fields, incl= uding quantum foundations, linear algebra, control theory, automata theory,= concurrency theory, and even linguistics. All of these applications rely o= n diagrammatic reasoning, which is to string diagrams as equational reasoni= ng is to ordinary terms. If we are to take string diagrams out of research papers and into practical= applications, we need understand how to implement diagrammatic reasoning. = This is the focus of my talk. There is a tight correspondence between symmetric monoidal categories where= every object has a coherent special Frobenius algebra structure and catego= ries of cospans of hypergraphs. This correspondence, therefore, takes us fr= om a topological understanding of string diagrams to a combinatorial data-s= tructure-like description. Moreover, diagrammatic reasoning translates via = this correspondence exactly to DPO rewriting with interfaces. The obvious follow-up question is: how much of this correspondence survives= if we drop the assumption about Frobenius structure? Can we use this corre= spondence to implement diagrammatic reasoning on vanilla symmetric monoidal= categories? The answer is yes, but we need to restrict the kinds of cospan= s we consider: the underlying hypergraph has to be acyclic and satisfy an a= dditional condition called monogamy. Moreover, we must restrict the DPO rew= riting mechanism to a variant that we call convex DPO rewriting. The good n= ews is that none of these modifications come with a significant algorithmic= cost. The material in this talk is joint work with Filippo Bonchi, Fabio Gadducci= , Aleks Kissinger and Fabio Zanasi, and has been published in a series of p= apers: - "Rewriting modulo symmetric monoidal structure", Proceedings of LiCS 2016 - "Confluence of Graph Rewriting with Interfaces", Proceedings of ESOP 2017 - "Rewriting with Frobenius", Proceedings of LiCS 2018 Zoom registration link: https://zoom.us/meeting/register/tJUldemsqjIoHtXZ5bssLDY851etgR2T29xR Link to YouTube live stream: https://youtu.be/nTWdbm19CFM ___________________________________________________ ---------------------------------------------------------------------------= - GReTA - Graph TRansformation Theory and Applications International Online Seminar Series ---------------------------------------------------------------------------= - Contact: greta@irif.fr [For admin and other information see: http://www.mta.ca/~cat-dist/ ]