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 π -calculus. 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.
Work supported by the ESPRIT BRA project “CONFER”.
Chapter PDF
Similar content being viewed by others
References
Abramsky, S., The Lazy Lambda Calculus, Research Topics in Functional Programming, pp65–116, Addison Wesley, 1989.
America, P. and de Bakker, J. and Kok, J. and Rutten, J., Denotational Semantics of a Parallel Object-Oriented Language, Information and Computation, 83(2), 1989.
America, P., Issues in the Design of a Parallel Object-Oriented Language, Formal Aspects of Computing, 1(4), pp366–411, 1989.
Astesiano, E. and Giovini, A., Generalized Bisimulation in Relational Specifications, STACS 88, LNCS 294, pp207–226, 1988.
Amadio, R., A Uniform Presentation of CHOCS and π-calculus, Rapport de Recherche 1726, INRIA-Lorraine, Nancy, 1992.
Berry, G. and Boudol, G., The Chemical Abstract Machine, 17th POPL, 1990.
Bolognesi, T. and Brinksma, E., Introduction to the ISO Specification Language LOTOS, in The Formal Description Technique LOTOS, North Holland, 1989.
Boudol, G., Towards a Lambda Calculus for Concurrent and Communicating Systems, TAPSOFT 89, LNCS 351, pp149–161, 1989.
Degano, P. and Darondeau, P., Causal Trees, 15th ICALP, LNCS 372, pp234–248, 1989.
De Nicola, R. and Hennessy, R., Testing Equivalences for Processes, Theor. Comp. Sci. 34, pp83–133, 1984.
Hoare, C.A.R., Communicating Sequential Processes, Prentice Hall, 1985.
Milner, R., Communication and Concurrency, Prentice Hall, 1989.
Milner, R., The polyadic π-calculus: a tutorial, Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci. Edinburgh Univ., 1991.
Milner, R., Functions as Processes, Technical Report 1154, INRIA Sofia-Antipolis, 1990. Final version in Journal of Mathem. Structures in Computer Science 2(2), pp119–141, 1992.
Milner, R. and Parrow, J. and Walker, D., A Calculus of Mobile Processes, (Parts I and II), Information and Computation, 100, pp1–77, 1992.
Milner, R. and Sangiorgi, D., Barbed Bisimulation, 19th ICALP, LNCS 623, pp685–695, 1992.
Phillips, I.C.C., Refusal Testings, Theor. Comp. Sci., 50, pp241–284, 1987.
Sangiorgi, D. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD thesis, Edinburgh Univ., 1992, to appear.
Thomsen, B., Calculi for Higher Order Communicating Systems, PhD thesis, Dept. of Computing, Imperial College, 1990.
Walker, D., π-calculus Semantics of Object-Oriented Programming Languages, Technical Report ECS-LFCS-90-122 LFCS, Dept. of Comp. Sci. Edinburgh Univ., 1990. Also in Proc. Conference on Theoretical Aspects of Computer Software, Tohoku University, Japan, Sept. 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sangiorgi, D. (1993). From π-calculus to higher-order π-calculus — and back. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_62
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.