An Implicitly-Typed Deadlock-Free Process Calculus
نویسندگان
چکیده
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 speci es how each communication channel is used) and a subusage relation.
منابع مشابه
A Partially Deadlock - free Typed Process Calculus ( I ) { A Simple System
Concurrency primitives play an important role in describing programs on parallel/distributed environments and also in writing interactive programs. Theoretical supports for concurrency primitives, however, have so far been very limited. Several type systems have been recently proposed through process calculi, but most of them do not solve inherent problems in concurrent programs: deadlock and n...
متن کاملA Partially Deadlock - free Typed Process Calculus ( II )
We propose a novel static type system for a process calculus, which ensures both partial deadlock-freedom and partial con uence. The key novel ideas are (1) introduction of order of channel use as type information, and (2) classi cation of communication channels into reliable and unreliable channels based on their usage, with a guarantee of the usage by the type system. We can ensure that commu...
متن کاملA New Type System for Deadlock-Free Processes
We extend a previous type system for the π-calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorithm or were not strong enough to ensure deadlock-freedom of processes using recursion. Although the extension is fairly simple, the new type system admits type inference and is much more expressive than the previous t...
متن کاملA Semantics for Propositions as Sessions
Session types provide a static guarantee that concurrent programs respect communication protocols. Recently, Caires, Pfenning, and Toninho, and Wadler, have developed a correspondence between propositions of linear logic and session typed π-calculus processes. We relate the cut-elimination semantics of this approach to an operational semantics for session-typed concurrency in a functional langu...
متن کاملTypes for Dyadic Interaction
We formulate a typed formalism for concurrency where types denote freely composable structure of dyadic interaction in the symmetric scheme. The resulting calculus is a typed reconstruction of name passing process calculi. Systems with both the explicit and implicit typing disciplines, where types form a simple hierarchy of types, are presented, which are proved to be in accordance with each ot...
متن کامل