Abstract
We compare the first-order and the higher-order paradigms for the representation of mobility in process algebras. The prototypical calculus in the first-order paradigm is the π-caleulus. By generalising its sort mechanism we derive an ω-order extension, called Higher-Order π-calculus. We give examples of its use, including the encoding of λ-calculus. Surprisingly, we show that such an extension does not add expressiveness: Higher-order processes can be faithfully represented at first order. We conclude that the first-order paradigm, which enjoys a simpler and more intuitive theory, should be taken as basic. Nevertheless, the study of the λ-calculus encodings shows that a higher-order calculus can be very useful for reasoning at a more abstract level.
Cite
CITATION STYLE
Sangiorgi, D. (1993). From π-calculus to higher-order π-calculus — and back. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 668 LNCS, pp. 151–166). Springer Verlag. https://doi.org/10.1007/3-540-56610-4_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.