Higher-Order Concurrency: Expressiveness and Decidability

Jorge A. Pérez
2010 Bulletin of the European Association for Theoretical Computer Science  
This installment of the concurrency column is devoted to a piece by Jorge Perez, which offers a survey of recent results on the expressiveness and decidability of core higher-order process calculi. In such calculi, processes can be passed around in communications, in very much the same way as functions can be applied to other functions in the λ-calculus. A celebrated result of Sangiorgi's shows that, in the π-calculus, the higherorder paradigm can be encoded in the first-order one-that is,
more » ... ss passing can be expressed in terms of channel passing. However, as the results in this column clearly indicate, there are still many open questions in the study of the expressiveness of higher-order communication in concurrency theory. I hope that this contribution by Jorge Perez will spur further developments in this research area. As the readers of this column will certainly know, on March 20, 2010, the concurrency-theory community lost one of its true giants, Robin Milner. An obituary for Robin is available on the EATCS web site. This installment of the Concurrency Column is an example of Robin's legacy to our research community and is dedicated to his memory.
dblp:journals/eatcs/Perez10 fatcat:qujdmqosn5fshcpa6yitfpcuei