2016/08/10 by Xian Xu
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.222.2
published as EPTCS 222, 2016, pp. 15-29 · In Proceedings EXPRESS/SOS 2016, arXiv:1608.02692
arxiv created 2016/08/10 · arxiv updated 2016/08/11
Parameterization extends higher-order processes with the capability of abstraction and application (like those in lambda-calculus). This extension is strict, i.e., higher-order processes equipped with parameterization is computationally more powerful. This paper studies higher-order processes with two kinds of parameterization: one on names and the other on processes themselves. We present two results. One is that in presence of parameterization, higher-order processes can encode first-order (name-passing) processes in a quite neat fashion, in contrast to the fact that higher-order processes without parameterization cannot encode first-order processes at all. In the other result, we provide a simpler characterization of the (standard) context bisimulation for higher-order processes with parameterization, in terms of the normal bisimulation that stems from the well-known normal characterization for higher-order calculus. These two results demonstrate more essence of the parameterization method in the higher-order paradigm toward expressiveness and behavioural equivalence.