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

Authors:
Robin Cockett;Luigi Santocanale
Affiliations:
Department of Computer Science, University of Calgary;Laboratoire d'Informatique Fondamentale de Marseille, Université Aix-Marseille I
Venue:
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Year:
2009

Citing 5
Cited 0

Games and full completeness for multiplicative linear logic

Journal of Symbolic Logic
Coherence completions of categories

Theoretical Computer Science - Special issue on linear logic, 1
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
A Language For Multiplicative-additive Linear Logic

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a feasible decision procedure for the equality of parallel arrows in the initial category with finite products and coproducts. The algorithm, in particular, handles the "additive units" and demonstrates that the complications introduced by the presence of these units can be managed in an efficient manner. This problem is directly related to the problemof determining the equivalence between (finite) processes communicating on a two-way channel.