A Language For Multiplicative-additive Linear Logic

Authors:
J. R. B. Cockett;C. A. Pastro
Affiliations:
Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, Alberta, Canada T2N 1N4;Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, Alberta, Canada T2N 1N4
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 3

Linear logic

Theoretical Computer Science
Computational interpretations of linear logic

Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
On the &pgr;-calculus and linear logic

MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Proving termination with multiset orderings

Communications of the ACM
A Term Calculus for Intuitionistic Linear Logic

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science

The logic of message-passing

Science of Computer Programming
On the word problem for Σπ-categories, and the properties of two-way communication

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
What is a good process semantics?

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

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.