An Implicitly-Typed Deadlock-Free Process Calculus (0)
Cached
Download Links
| Venue: | In Proc. of Workshop on High-Level Concurrent Language (HLCL’98), volume 16(3) of ENTCS |
| Citations: | 26 - 8 self |
BibTeX
@INPROCEEDINGS{Kobayashi_animplicitly-typed,
author = {Naoki Kobayashi and Shin Saito and Eijiro Sumii},
title = {An Implicitly-Typed Deadlock-Free Process Calculus},
booktitle = {In Proc. of Workshop on High-Level Concurrent Language (HLCL’98), volume 16(3) of ENTCS},
year = {},
pages = {489--503},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We extend Kobayashi and Sumii's type system for the deadlock -free #-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii's type system helps high-level reasoning about concurrent programs by guaranteeing that communication on certain channels will eventually succeed. It can ensure, for example, that a process implementing a function really behaves like a function. However, because it lacked a type reconstruction algorithm and required rather complicated type annotations, applying it to real concurrent languages was impractical. We have therefore developed a type reconstruction algorithm for an extension of the type system. The key novelties that made it possible are generalization of usages (which specifies how each communication channel is used) and a subusage relation. 1
