| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9655964 | Electronic Notes in Theoretical Computer Science | 2005 | 43 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
J.R.B. Cockett, C.A. Pastro,