%J Journal of Logical and Algebraic Methods in Programming
%V 95
%L discovery10046407
%K Science & Technology, Technology, Computer Science, Theory & Methods, Logic, Computer Science, Science & Technology - Other Topics, MONOIDAL CATEGORIES, ALGEBRA, MONADS, GRAPHS
%T Deconstructing Lawvere with distributive laws
%O © 2017 Elsevier Inc. All rights reserved. This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
%D 2018
%X PROs, PROPs and Lawvere categories are related notions adapted to the study of algebraic structures borne by an object in a category: PROs are monoidal, PROPs are symmetric monoidal and Lawvere categories are cartesian. This paper connects the three notions using Lack's technique for composing PRO(P)s via distributive laws. We show that Lawvere categories can be seen as the composite PROP , where  expresses the algebraic structure in linear form and  express the ability of copying and discarding them. In turn the PROP  can be decomposed in terms of PROs as  where expresses the ability of permuting variables and  is the PRO encoding the syntactic structure without permutations.
%A F Bonchi
%A P Sobocinski
%A F Zanasi
%P 128-146
%I ELSEVIER SCIENCE INC