Kohei Honda. Types for dydadic interaction. In CONCUR'93, volume 715 of Lecture Notes in Computer Science, pages 509--523, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... early version of the Pict type system was presented in [PRT93] Typed process calculi with related goals have been proposed by Nierstrasz [Nie95] and Vasconcelos [Vas94] Further refinements to the channel typing discipline incorporating notions of linear channel usage have been studied by Honda [Hon93, HY94, Hon96] and more recently by Kobayashi and Yonezawa [KY94] and the present authors [KPT96] 3.1 Channel Types Most type systems for process calculi and concurrent languages impose the constraint that each channel must be used throughout its lifetime to carry values of a single type. This ....

Kohei Honda. Types for dydadic interaction. In CONCUR'93, volume 715 of Lecture Notes in Computer Science, pages 509--523, 1993.

....6 Final remarks Several type systems have been proposed for process calculi. The most relevant for this work are [10] where the type system has input output modalities to distinguish between the capabilities of reading and writing on names, and the type systems expressing linearity information [3, 7, 4]. The type system for receptiveness represents a refinement of [10] and, in the case of linear receptiveness, also of [7] Also [10] and [7] contain studies of the effect of types on process behaviours, using barbed congruence. The proof techniques developed in this paper are easier to apply, ....

K. Honda. Types for dydadic interaction. In E. Best, editor, Proc. CONCUR '93, LNCS 715, pages 509--523. Springer Verlag, 1993.

....programming with inheritance and method overriding. Therefore, our type system of HACL is highly useful not only in HACL itself, but also in other concurrent languages based on message passing. Although type systems for concurrent calculi have been recently investigated by many researchers[5][9][18] 23] 24] we 1 From our experience in programming using concurrent object oriented language ABCL[25] we have long recognized that it is very cumbersome to make such topologies between concurrent objects using only first order concurrent objects. 2 believe that our formulation is one of the ....

....useful for the abstract interpretation, because it gives information to decide which arguments can be dropped during abstract interpretation. Typed Concurrent Calculi Recently, type systems for concurrent calculi such as polyadic calculus and object calculus, were proposed by several people[5][9][18] 23] 24] Gay s sorting algorithm[5] can be considered a specific instance of the basic type system of HACL, where base types are restricted to only o, and letpolymorphism and higher order processes are dropped. Pierce and Sangiorgi[18] introduced I O modes to calculus in a different manner ....

Honda, K., "Types for Dydadic Interaction," in Proceedings of CONCUR'93, 1993.

.... for example, a variant of the polymorphic pi calculus with I O modalities (as well as higher order polymorphism) forms the core of the Pict programming language [PT96] Another class of pi calculus type systems for which behavioral consequences have been studied are those based on linear typing [Hon93, KPT96, Hon96]. The crucial observation here is that, in the absence of global operators such as general choice, a communication occurring on a linear (iuse oncej) channel can never interfere with any other communication, and hence preserves the weak bisimilarity class of the process. Thus, like I O modalities ....

Kohei Honda. Types for dydadic interaction. In CONCUR'93, volume 715 of Lecture Notes in Computer Science, pages 509523, 1993.

....are shared between just two processes. The motivating intuitions behind this calculus have the flavor of a type system, suggesting that one might achieve the same effect in a standard pi calculus by introducing a refined type system instead of altering the syntax. In fact, earlier work by Honda [Hon93] did adopt a type theoretic perspective related to ours. Our type system shares a good deal with linear type systems for lambda calculi and related programming languages [Abr93, Wad91, Hod92, Bak92, Mac94, TWM95] In particular, linear typing has recently been proposed as a framework for ....

.... encoded as follows: x [ y] P ] x 0 : l [ T ] c : l 1 [ x [ y; c; x 0 ] j c [ x 0 =x]P ] x [ y] P ] x [ y; c; x 0 ] c [ j [ x 0 =x]P ] Linearized channel types can be viewed as a variant on a fragment of Honda s types for dyadic interaction [Hon93]. Combining the intuitions behind replicated and linearized channel types yields another important usage analysis, which Milner calls unique handling [Mil91] a channel is uniquely handled if it has a single replicated receiver and, at any given moment, at most one sender. That is, the ....

Kohei Honda. Types for dydadic interaction. In CONCUR'93, volume 715 of Lecture Notes in Computer Science, pages 509--523, 1993.

....programming with inheritance and method overriding. Therefore, our type system of HACL is highly useful not only in HACL itself, but also in other concurrent languages based on message passing. Although type systems for concurrent calculi have been recently investigated by many researchers[4][7][14] 19] 20] we believe that our formulation is one of the most elegant and useful ones. We also give several simple refinements of the basic type system to get more precise information such as input output modes of messages. The refined type system is useful for the detection of orphan messages, ....

....also useful for abstract interpretation, because it gives information to decide which arguments can be dropped during abstract interpretation. Typed Concurrent Calculi Recently, type systems for concurrent calculi such as polyadic calculus and object calculus, were proposed by several people[4][7][14] 19] 20] Gay s sorting algorithm[4] can be considered a specific instance of the basic type system of HACL, where base types are restricted to only o and higher order processes are dropped. Pierce and Sangiorgi[14] introduced I O modes to calculus in a different manner from ours. They ....

Honda, K., "Types for Dydadic Interaction," in Proceedings of CONCUR'93, 1993.

....it is not easy to utilize stack and registers effectively with the assumption that evaluation may be blocked. Recently, a number of studies focused on concurrency primitives and tried to obtain better foundations. There are a number of researches on process equivalence[13, 21, 5] type systems[3, 17, 9], relationship with logic[8, 22] etc. Concurrent programming languages directly based on such new foundations have also been designed and implemented[19, 10] However, such foundations essentially have not been able to solve the above problems. Rather, if we naively throw away function primitives ....

Kohei Honda. Types for dydadic interaction. In CONCUR'93, volume 715 of Lecture Notes in Computer Science, pages 509--523, 1993.

.... for example, a variant of the polymorphic pi calculus with I O modalities (as well as higher order polymorphism) forms the core of the Pict programming language [PT96] Another class of pi calculus type systems for which behavioral consequences have been studied are those based on linear typing [Hon93, KPT96, Hon96]. The crucial observation here is that, in the absence of global operators such as general choice, a communication occurring on a linear ( useonce ) channel can never interfere with any other communication, and hence preserves the weak bisimilarity class of the process. Thus, like I O modalities ....

Kohei Honda. Types for dydadic interaction. In CONCUR'93, volume 715 of Lecture Notes in Computer Science, pages 509--523, 1993.

No context found.

Kohei Honda. Types for dydadic interaction. In CONCUR'93, volume 715 of Lecture Notes in Computer Science, pages 509--523, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC