## A Generic Type System for the Pi-Calculus (2003)

### Cached

### Download Links

- [www.kb.cs.titech.ac.jp]
- [www.kb.ecei.tohoku.ac.jp]
- [www.sato.kuis.kyoto-u.ac.jp]
- [www.kb.ecei.tohoku.ac.jp]
- [www.yl.is.s.u-tokyo.ac.jp]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 90 - 8 self |

### BibTeX

@INPROCEEDINGS{Igarashi03ageneric,

author = {Atsushi Igarashi and Naoki Kobayashi},

title = {A Generic Type System for the Pi-Calculus},

booktitle = {Theoretical Computer Science},

year = {2003},

pages = {128--141},

publisher = {ACM}

}

### Years of Citing Articles

### OpenURL

### Abstract

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 sharing of a large amount of work such as a proof of type preservation, making it easy to develop new type systems.