A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive categories with additives. It is also shown that proof equivalence is decidable by showing that the cut elimination rewrites supply a confluent rewriting system modulo equations. © 2005 Elsevier B.V. All rights reserved.
Cockett, J. R. B., & Pastro, C. A. (2005). A language for multiplicative-additive linear logic. In Electronic Notes in Theoretical Computer Science (Vol. 122, pp. 23–65). https://doi.org/10.1016/j.entcs.2004.06.049