A Language For Multiplicative-additive Linear Logic


A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. e 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… (More)
DOI: 10.1016/j.entcs.2004.06.049

3 Figures and Tables


  • Presentations referencing similar topics