A language for multiplicative-additive linear logic
范畴论
2010-03-03 v1 逻辑
摘要
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.
引用
@article{arxiv.math/0404286,
title = {A language for multiplicative-additive linear logic},
author = {J. R. B. Cockett and C. A. Pastro},
journal= {arXiv preprint arXiv:math/0404286},
year = {2010}
}
备注
16 pages without appendices, 30 with appendices