On affine usages in signal-based communication
classification
💻 cs.LO
keywords
affinecommunicationsignal-basedsystemusagesaffinityapplicationcomposed
read the original abstract
We describe a type system for a synchronous pi-calculus formalising the notion of affine usage in signal-based communication. In particular, we identify a limited number of usages that preserve affinity and that can be composed. As a main application of the resulting system, we show that typable programs are deterministic.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.