Semantic Proof of Confluence of the Categorical Reduction System for Linear Logic

We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established. Namely, we obtain a method to determine if two morphisms are equal up to a certain equivalence.