{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:18:20Z","timestamp":1648653500862},"reference-count":5,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:p>We 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 <jats:italic>coassociativity<\/jats:italic> and <jats:italic>cocommutativity<\/jats:italic>. This amounts to checking the confluence of some rewriting systems.<\/jats:p>","DOI":"10.1017\/s0960129511000661","type":"journal-article","created":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T06:49:48Z","timestamp":1351579788000},"page":"970-986","source":"Crossref","is-referenced-by-count":0,"title":["Properties of co-operations: diagrammatic proofs"],"prefix":"10.1017","volume":"22","author":[{"given":"PIERRE","family":"RANNOU","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2012,10,30]]},"reference":[{"key":"S0960129511000661_ref4","first-page":"163","volume-title":"S\u00e9minaires et Congr\u00e8s","author":"Lafont","year":"2010"},{"key":"S0960129511000661_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(03)00069-0"},{"key":"S0960129511000661_ref5","article-title":"Generalized bialgebras and triples of operads","volume":"320","author":"Loday","year":"2008","journal-title":"Ast\u00e9risque"},{"key":"S0960129511000661_ref2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2643"},{"key":"S0960129511000661_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.003"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129511000661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T17:00:05Z","timestamp":1556125205000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129511000661\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,30]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["S0960129511000661"],"URL":"https:\/\/doi.org\/10.1017\/s0960129511000661","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,30]]}}}