A New Type System for Deadlock-Free Processes

9 years 11 months ago
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 type systems that admit type inference. In fact, we show that the simply-typed calculus with recursion can be encoded into the deadlock-free fragment of our typed -calculus. To enable analysis of realistic programs, we also present an extension of the type system to handle recursive data structures like lists. Both extensions have already been incorporated into the recent release of TyPiCal, a type-based analyzer for the -calculus.
Naoki Kobayashi
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Authors Naoki Kobayashi
Comments (0)