Abstract
We study an asynchronous π-calculus, called Local π (Lπ), 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 Lπ and show some applications: the derivability of delayed input; the correctness of an optimisation of the encoding of call-by-name λ-calculus; the validity of some laws for the Join-calculus.
Cite
CITATION STYLE
Merro, M., & Sangiorgi, D. (1998). On asynchrony in name-passing calculi. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 856–867). Springer Verlag. https://doi.org/10.1007/bfb0055108
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
