On the Computation Power of Name Parameterization in Higher-order Processes

TL;DR

This paper investigates the computational capabilities of name parameterization in higher-order processes, showing it can model recursive functions and establishing encodings with pi-calculus, thus enhancing understanding of process expressiveness.

Contribution

It introduces a complete model for name parameterization in higher-order processes and compares it with pi-calculus through encodings, revealing its expressive power.

Findings

Name parameterization creates a complete model capable of expressing recursive functions.

Two encodings between name parameterization and pi-calculus are provided.

The model enhances the understanding of expressiveness in higher-order process calculi.

Abstract

Parameterization extends higher-order processes with the capability of abstraction (akin to that in lambda-calculus), and is known to be able to enhance the expressiveness. This paper focuses on the parameterization of names, i.e. a construct that maps a name to a process, in the higher-order setting. We provide two results concerning its computation capacity. First, name parameterization brings up a complete model, in the sense that it can express an elementary interactive model with built-in recursive functions. Second, we compare name parameterization with the well-known pi-calculus, and provide two encodings between them.