Static analysis of interaction nets for distributed implementations

Interaction nets can be seen as both a programming language and an intermediate language for the implementation of other paradigms of computation. One of their principal advantages is that the reduction process is both local and confluent, thus being ideally suited for the development of parallel implementations. For distributed memory architectures, however, there is a need to know how the net should be distributed amongst processors, i.e. how do we break up the net so that the communication is kept to a minimum. The purpose of this paper is to suggest an analysis to solve this problem, and hint at other possible analyses for different applications, for example dynamic load balancing.