On the Complexity of Termination Inference for Processes

We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done in polynomial time for two of these, but that this is not the case for the two most expressive systems. To remedy this, we study two modifications of these type systems that allow us to recover a polynomial type inference.

• Type: Conference
• Year: 2007
• Where: TGC
• Authors: Romain Demangeon, Daniel Hirschkoff, Naoki Kobayashi, Davide Sangiorgi
• Keywords: Applied Computing, Polynomial Type Inference, TGC 2007, Type Inference, Type Systems