A generic type system for the Pi-calculus

Atsushi Igarashi, Naoki Kobayashi
2004 Theoretical Computer Science  
We propose a general, powerful framework of type systems for the π-calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial properties like deadlock-freedom and race-freedom. A key idea is to express types and type environments as abstract processes: We can check various properties of a process by checking the corresponding properties of its type environment. The framework clarifies the essence of recent complex type systems, and it also enables
more » ... haring of a large amount of work such as a proof of type preservation, making it easy to develop new type systems. * A preliminary summary of this paper appeared in
doi:10.1016/s0304-3975(03)00325-6 fatcat:p63poknv7baillwteswjibueve