Summary: We study an asynchronous \(\pi\)-calculus, called Local \(\pi\) \((\text{L}\pi)\), where: (a) only the output capability of names may be transmitted; (b) there is no matching or similar constructs. We study the basic operational and algebraic theory of \(\text{L}\pi\) and show some applications: the derivability of delayed input; the correctness of an optimization of the encoding of call-by-name \(\lambda\)-calculus; the validity of some laws for the Join-calculus.
For the entire collection see [Zbl 0893.00039].