Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proc. of PARLE'94, number 817 in LNCS, pages 398--413. SpringerVerlag, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....for high level [TT97] and low level [CWM99] languages, race condition avoidance [FA99] and access control [SS00] Early type systems for the calculus [Mil99,PS96] focus on regulating the data sent on channels. Subsequent type systems also regulate process behaviour; for example, session types [THK94,HVK98] regulate pairwise interactions and linear types [Kob98] help avoid deadlocks. A recent paper [DG00] explicitly proposes a type and e ect system for the calculus, and the idea of latent e ects on channel types. This idea can also be represented in a recent general framework for concurrent type ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings 6th European Conference on Parallel Languages and Architecture, volume 817 of Lectures Notes in Computer Science, pages 398-413. Springer, 1994.

....Communication in distributed systems is typically structured by protocols, which specify the sequence and form of messages passing over communication channels between agents. In order for correct communication to occur, it is essential that protocols are obeyed. The theory of session types [6, 12] allows the specification of a protocol to be expressed as a type; when a communication channel is created, a session type is associated with it. A session type specifies not only the data types of individual messages, but also the state transitions of the protocol and hence the allowable ....

....client sends a single message consisting of a pair of integers (Honda et al. 6] call this piggybacking ) In this case, the type of the server side would be (Int Int) Int.End and the type of the client side would again be obtained by exchanging and . The duality operator : S S [12, 6, 3, 13] is an important part of the theory of session types, but we do not need to discuss it in this paper because we only consider clients or servers in isolation. 2.2 Branching Types Now let us modify the protocol and add a negation operation to the server. The client selects one of two commands: ....

[Article contains additional citation context not shown here]

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

....Pierce and Sangiorgi [PS96] propose a refinement based on subtyping channel types. Our type system omits subtyping, for the sake of simplicity, but we expect it would be a straightforward addition. Later type systems for the # calculus also regulate process behaviour; for example, session types [THK94, HVK98] regulate pairwise interactions and linear types [Kob98] help avoid deadlocks. A recent paper [DG00] explicitly proposes a type and e#ect system for the # calculus, and the idea of latent e#ects on channel types. This idea can also be represented in a recent general framework for concurrent type ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In 6th European Conference on Parallel Languages and Architecture (PARLE'94), volume 817 of Lectures Notes in Computer Science, pages 398--413. Springer, 1994.

....is th t thO use di#erent rules for input output on di#erent types of ch nnels. We solved th t problem by generalizing our previous type systems. One of th key ideas was to use a process like term to describe th ch annelwise beh avior of a process. Similar ideas are found in earlier type systems [17,10]: For example, Nierstrasz [10] used CCS like terms as types of concurrent objects and defined subtyping relations. Our type reconstruction algorith can be considered a non trivial extension of Igarash i and Kobayash i s type reconstruction algorith m [4] forth linear # calculus [6] 6Conclusion ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of PARLE'94, LNCS 817, pages 398--413, 1994. 502

....state of P is greater than that of the state of Q. This enables local analysis of deadlock freedom, and hence offers the possibility of constructing deadlock free networks from deadlock free subcomponents. None of the above mentioned approaches is based on types. However, Takeuchi, Honda and Kubo [25] have recently developed a typed language for interaction, in which the type system guarantees avoidance of a class of communication errors; these errors can be viewed as weak forms of deadlock, but do not include the possibility of cyclic dependencies. Based on this work, Kobayashi, Pierce and ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994. 19

....linear types in [KPT96] types for partial deadlock freedom in [Kob98] and, as already noted, parametric polymorphism in [Tur95] 7.3.2 Session Types in the Pi Calculus. Honda and his co workers proposed a variant of the # calculus where some channels are designated to be session channels, in [THK94] and [HVK98] Such a channel is allowed to carry a sequence of different message types over time, by contrast to a channel that is restricted to a single type of message throughout its lifetime, as in the simply typed # calculus. More recently, Gay and Hole in [GH99] have developed a type system ....

....to a single type of message throughout its lifetime, as in the simply typed # calculus. More recently, Gay and Hole in [GH99] have developed a type system for the # calculus which combines session types, subtyping and recursive types. Whereas session channels form a distinct syntactic category in [THK94] and [HVK98] Gay and Hole enforce this distinction, perhaps more elegantly, by means of their type system. Consider a process P , which receives an integer along a channel x before it sens a boolean along the same x. In such a situation, x can be assigned the session type [int] bool] end and ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In PARLE'94, vol. 817 of LNCS, pp. 398--413. Springer-Verlag, 1994. 29

....Communication Session types in the # calculus and orderly cummunication in AC are motivated by similar considerations. Session types orginated with the work of Honda and his collaborators, who proposed a variant of the # calculus where some channels are designated to be session channels, in [THK94] and [HVK98] Such a channel is allowed to carry a sequence of different message types over time, by contrast to a channel that is restricted to a single type of message throughout its lifetime, as in a system of simple types for the # calculus. More recently, Gay and Hole in [GH99] have ....

....message throughout its lifetime, as in a system of simple types for the # calculus. More recently, Gay and Hole in [GH99] have developed a type system for the # calculus which combines session types, subtyping and recursive types. Whereas session channels form a distinct syntactic category in [THK94] and [HVK98] Gay and Hole enforce this distinction by means of their type system. Despite the many similarities, there are also many differences between sessions types in the # calculus and orderly communication in AC . Technical issues regarding the former do not apply to the latter and ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In PARLE'94, vol. 817 of LNCS, pp. 398--413. Springer-Verlag, 1994.

....of the intended uses of channels within a system. This line of research has not been purely theoretical: the Pict programming language [10] is directly based on the calculus and has a rich type system which incorporates subtyping on channel types and higher order polymorphism. Honda et al. [3, 12] have proposed calculus like languages in which certain channels can be given session types. Such a channel, which we will call a session channel, is not restricted to carrying a single type of message for the whole of its lifetime. Instead, its type speci es a sequence of message types. Some of ....

.... with output pre xing [7] We omit the original calculus choice construct P Q, partly in order to keep the language close to the core of Pict [10] However, we have the constructs introduced in Section 1 for choosing between a collection of labelled processes, as proposed by Honda et al. [3, 12]. We also omit the matching construct, which allows channel names to be tested for equality, again because it is not present in core Pict. The inclusion of output pre xing is di erent from many recent presentations of the calculus, but it is essential because our type system must be able to ....

[Article contains additional citation context not shown here]

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

....for high level [TT97] and low level [CWM99] languages, race condition avoidance [FA99] and access control [SS00] Early type systems for the calculus [Mil99, PS96] focus on regulating the data sent on channels. Subsequent type systems also regulate process behaviour; for example, session types [THK94, HVK98] regulate pairwise interactions and linear types [Kob98] help avoid deadlocks. A recent paper [DG00] explicitly proposes a type and e ect system for the calculus, and the idea of latent e ects on channel types. This idea can also be represented in a recent general framework for concurrent type ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings 6th European Conference on Parallel Languages and Architecture, volume 817 of Lectures Notes in Computer Science, pages 398-413. Springer, 1994.

....supertype. In each of these type systems, the type assigned to a channel describes a single use of the channel; if that type permits the channel to be used more than once, then each use transmits the same type of information. A somewhat di erent approach has been taken by Takeuchi, Honda and Kubo [29]. They have proposed a language in which a channel can be used for a session consisting of a series of message transmissions of di erent types (for example, an integer followed by a boolean) this models a situation in which two components establish a private connection and then use it for an ....

....the formation of session types with higher order polymorphism is likely to be technically dicult. At this point we will draw on the work of Takeuchi et al. who considered session types in conjunction with principal type schemes (although not with higher order polymorphism as found in Pict) [29], and Puntigam, whose type system incorporates subtyping and shares some of the properties of session types [28] This stage of the project will extend to six months into the third year. Dr Gay will begin to look at the theoretical issues earlier in the project, with the intention of identifying ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

....to develop a exible framework within which a variety of type systems can be investigated, with as much re use of existing theory and proof as possible. Our formalisation of the linear type system is a step towards a treatment of a language [5] based on the pi calculus and combining session types [10, 24] with subtyping [20] We should emphasise that the purpose of this formalisation is to prove properties of the type system itself, principally type soundness, rather than to support typechecking. However, given the formalisation of a pi calculus type system it should be straightforward to ....

....environment or in an enclosing restriction) has polarity l. We also prove their theorems about correct use of linear and non linear channels, for example that if a typed process contains a term x [ z] P j x [ z] Q then the type of x is non linear. 11 Extension to Session Types Honda et al. [10, 24] have proposed session types, which allow successive communications on a channel to carry di erent message types. Branching is also allowed, so that the transmission of a particular value (from a nite range) can determine the type of the subsequent interaction. Consider, for example, a server for ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

....to develop a exible framework within which a variety of type systems can be investigated, with as much re use of existing theory and proof as possible. Our formalisation of the linear type system is a step towards a treatment of a language [2] based on the pi calculus and combining session types [18, 6] with subtyping [15] Related Work The following table summarises work on formalisation of the pi calculus by a number of researchers, including the present paper. The parameters are: the theorem proving system used; the style of pi calculus (monadic or polyadic) the approach to binding (names, ....

....environment or in an enclosing restriction) has polarity l. We also prove their theorems about correct use of linear and non linear channels, for example that if a typed process contains a term x [ z] P j x [ z] Q then the type of x is non linear. 11 Extension to Session Types Honda et al. [6, 18] have proposed session types, which allow successive communications on a channel to carry di erent message types. Branching is also allowed, so that the transmission of a particular value (from a nite range) can determine the type of the subsequent interaction. Consider, for example, a server for ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

....message obscures the definition of the process. Adding 9 polymorphism does not help because it introduces too much flexibility: a polymorphic channel can carry messages of any type, and there is no way to specify that the first message must be an integer and the second a boolean. Honda et al. [7, 30] have proposed a type system which introduces the idea of session channels. In this system, the example above can be typed as x : int] bool] end 2 x [2] y [a : bool] P j x [a : int] y [true] Q if we assume that P and Q do not use x. Honda et al. use a rather ....

....: bool] end x [a : int] y [true ] Q and the typing rule for parallel composition must check that the two types of x are complementary in the evident sense, and combine them into the fully used (indicated by the superscript of 2) session type [int] bool] end 2 . Originally [30], linear use of session channels was guaranteed syntactically; session channels formed a separate syntactic category and could not be transmitted between processes. Later [7] the system was generalised to allow session channels to be transmitted, subject to controls similar to those in the linear ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994. 13

....of the intended uses of channels within a system. This line of research has not been purely theoretical: the Pict programming language [11] is directly based on the calculus and has a rich type system which incorporates subtyping on channel types and higher order polymorphism. Honda et al. [13, 3] have proposed calculus like languages in which certain channels can be given session types. Such a channel, which we will call a session channel, is not restricted to carrying a single type of message for the whole of its lifetime; instead, its type specifies a sequence of message types. Some of ....

.... with output prefixing [8] We omit the original calculus choice construct P Q, partly in order to keep the language close to the core of Pict [11] However, we have the constructs introduced in Section 1 for choosing between a collection of labelled processes, as proposed by Honda et al. [13, 3]. We also omit the matching construct, which allows channel names to be tested for equality, again because it is not present in core Pict. The inclusion of output prefixing is different from many recent presentations of the calculus, but it is essential because our type system must 4 be able to ....

[Article contains additional citation context not shown here]

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

....state of P is greater than that of the state of Q. This enables local analysis of deadlock freedom, and hence offers the possibility of constructing deadlock free networks from deadlock free subcomponents. None of the above mentioned approaches is based on types. However, Takeuchi, Honda and Kubo [25] have recently developed a typed language for interaction, in which the type system guarantees avoidance of a class of communication errors; these errors can be viewed as weak forms of deadlock, but do not include the possibility of cyclic dependencies. Based on this work, Kobayashi, Pierce and ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994. 19

....[CWM99] languages, race condition avoidance [FA99] and access control [SS00] Early type systems for the p calculus [Mil99,PS96] focus on regulating the data sent on channels. Subsequent type systems also regulate process behaviour; for example, session types regulate pairwise interactions [THK94,HVK98], and linear types help avoid deadlocks [Kob98] A recent paper [DG00] explicitly proposes a type and effect system for the p calculus, and the idea of latent effects on channel types. This idea can also be represented in a recent general framework for concurrent type systems [IK01] Still, the ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings 6th European Conference on Parallel Languages and Architecture, volume 817 of Lectures Notes in Computer Science, pages 398--413. Springer, 1994.

....linear types in [KPT96] types for partial deadlock freedom in [Kob98] and, as already noted, parametric polymorphism in [Tur95] 7.3. 2 Session Types in the Pi Calculus Honda and his co workers proposed a variant of the calculus where some channels are designated to be session channels, in [THK94] and [HVK98] Such a channel is allowed to carry a sequence of different message types over time, by contrast to a channel that is restricted to a single type of message throughout its lifetime, as in the simply typed calculus. More recently, Gay and Hole in [GH99] have developed a type system ....

....to a single type of message throughout its lifetime, as in the simply typed calculus. More recently, Gay and Hole in [GH99] have developed a type system for the calculus which combines session types, subtyping and recursive types. Whereas session channels form a distinct syntactic category in [THK94] and [HVK98] Gay and Hole enforce this distinction, perhaps more elegantly, by means of their type system. Consider a process P , which receives an integer along a channel x before it sens a boolean along the same x. In such a situation, x can be assigned the session type [int] bool] end and ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In PARLE'94, vol. 817 of LNCS, pp. 398--413. Springer-Verlag, 1994. 29

....in [NKT96] types for partial deadlock freedom in [Kob97, Kob98] and, as already noted, parametric polymorphism in [Turner96] 7.3. 2 Session Types in the Pi Calculus Honda and his co workers proposed a variant of the calculus where some channels are designated to be session channels, in [THK94] and [HVK98] Such a channel is allowed to carry a sequence of different message types over time, by contrast to a channel that is restricted to a single type of message throughout its lifetime, as in the simply typed calculus. More recently, Gay and Hole in [GH99] have developed a type system ....

....a single type of message throughout its lifetime, as in the simply typed calculus. More recently, Gay and Hole in [GH99] have developed a type system for the calculus which combines session types, subtyping and recursive types. Whereas session channels form a distinct syntactic category in [THK94] and [HVK98] Gay and Hole enforce this distinction, perhaps more elegantly, by means of their type system. Consider a process P , which receives an integer along a channel x before it sens a boolean along the same x. In such a situation, x can be assigned the session type [int] bool] end and ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In PARLE'94, vol. 817 of LNCS, pp. 398--413. Springer-Verlag, 1994.

....Communication Session types in the calculus and orderly cummunication in AC are motivated by similar considerations. Session types orginated with the work of Honda and his collaborators, who proposed a variant of the calculus where some channels are designated to be session channels, in [THK94] and [HVK98] Such a channel is allowed to carry a sequence of different message types over time, by contrast to a channel that is restricted to a single type of message throughout its lifetime, as in a system of simple types for the calculus. More recently, Gay and Hole in [GH99] have ....

....of message throughout its lifetime, as in a system of simple types for the calculus. More recently, Gay and Hole in [GH99] have developed a type system for the calculus which combines session types, subtyping and recursive types. Whereas session channels form a distinct syntactic category in [THK94] and [HVK98] Gay and Hole enforce this distinction by means of their type system. Despite the many similarities, there are also many differences between sessions types in the calculus and orderly communication in AC . Technical issues regarding the former do not apply to the latter and ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In PARLE'94, vol. 817 of LNCS, pp. 398--413. Springer-Verlag, 1994.

.... object A would be the ready specification f(s; Sigma A (s) j length(s) is eveng [ f(s; X) j X Sigma A (s) length(s) is oddg: A detailed development of this idea, which is a subject for future work, should lead to interesting connections with the type system proposed by Takeuchi et al. [46]. 8 Conclusions We have presented a semantic view of the specification and verification of concurrent systems. The relevant technical machinery is the notion of specification structures, which provides a systematic approach to the construction of a hierarchy of semantic universes allowing us to ....

....ports or channels as input or outputs, and checking that outputs are always connected to inputs. There are several variations which include information about how many times channels are used [32] the order of usage of channels [31] subtyping [42] types for choice and branching behaviour [46]. The distinguishing features of our semantic approach are as follows. First, it is based on a category theoretic description of the collective structure of processes and their relationship to specifications. Second, we have proposed a methodology (via the notion of a specification structure) for ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994. 63

....of the intended uses of channels within a system. This line of research has not been purely theoretical: the Pict programming language [16] is directly based on the calculus and has a rich type system which incorporates subtyping on channel types and higher order polymorphism. Honda et al. [5, 20] have proposed calculus like languages in which certain channels can be given session types. Such a channel, which we will call a session channel, is not restricted to carrying a single type of message for the whole of its lifetime; instead, its type specifies a sequence of message types. Some of ....

.... with output prefixing [12] We omit the original calculus choice construct P Q, partly in order to keep the language close to the core of Pict [16] However, we have the constructs introduced in Section 1 for choosing between a collection of labelled processes, as proposed by Honda et al. [5, 20]. We also omit the matching construct, which allows channel names to be tested for equality, again because it is not present in core Pict. The inclusion of output prefixing is different from many recent presentations of the calculus, but it is essential because our type system must 4 be able to ....

[Article contains additional citation context not shown here]

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

....TYPES FOR MONADIC MOBILE PROCESSES NOBUKO YOSHIDA Abstract. While types for name passing calculi have been studied extensively in the context of sorting of polyadic calculus [26, 7, 43, 11, 35, 41, 24, 42, 14, 22], the type abstraction on the corresponding level is not possible in the monadic setting, which was left as an open issue by Milner [26] We solve this problem with an extension of sorting which captures dynamic aspects of process behaviour in a simple way. Equationally this results in the full ....

....complex communication structures, including those with parallelism and complex information flow. As a means to study rich computational structures representable in name passing processes, a notion of types called sorting was introduced by Milner [26] and has been studied extensively since then [7, 43, 11, 35, 41, 24, 42, 14, 22]. Sorting shows how a name carries another name. For example, if v has a type, say, nat, and we have a term av:0, then a should have a type (nat) a type which carries nat. This idea and its ramifications have been used to analyse significant semantic properties of calculi with polyadic name ....

[Article contains additional citation context not shown here]

Takeuchi, K., Honda, K. and Kubo, M., An Interaction-based Language and its Typing System. PARLE'94, LNCS 817, pp.398--413, Springer-Verlag, 1994.

....TYPES FOR MONADIC MOBILE PROCESSES NOBUKO YOSHIDA Abstract. While types for name passing calculi have been studied extensively in the context of sorting of polyadic calculus [5, 34, 9, 28, 32, 19, 33, 10, 17], the same type abstraction is not possible in the monadic setting, which was left as an open issue by Milner [21] We solve this problem with an extension of sorting which captures dynamic aspects of process behaviour in a simple way. Equationally this results in the full abstraction of the ....

....complex communication structures, including those with parallelism and intricate information flow. As a means to study rich computational structures representable in name passing processes, a notion of types called sorting was introduced by Milner [21] and has been studied extensively since then [5, 34, 9, 28, 32, 19, 33, 10, 17]. Sorting shows how a name carries another name. For example, if v has a type, say, nat, and we have a term av:0, Department of Computer Science, University of Edinburgh, The King s Buildings, Mayfield Road, Edinburgh, EH9 3JZ, UK. e mail: ny dcs.ed.ac.uk. Partially supported by JSPS Fellowship ....

[Article contains additional citation context not shown here]

Takeuchi, K., Honda, K. and Kubo, M., An Interaction-based Language and its Typing System. PARLE'94, LNCS 817, pp.398--413, Springer-Verlag, 1994.

....confluence in a pi calculus fragment with only replicated inputs. Effects similar to our linear typing have also been achieved by more syntactic means, as in Honda and Yoshida s notion of beta reduction for concurrent combinators [HY94] A more recent paper by Takeuchi, Honda, and Kubo [THK94] describes a modified pi calculus whose syntax guarantees that certain channels are shared between just two processes, achieving a restricted form of linearity by much more elementary means. Kobayashi s type system for partial deadlock freedom [Kob98] is based on the linear type system presented ....

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proceedings of PARLE'94, pages 398--413. SpringerVerlag, 1994. Lecture Notes in Computer Science number 817.

....state of P is greater than that of the state of Q. This enables local analysis of deadlockfreedom, and hence offers the possibility of constructing deadlock free networks from deadlock free subcomponents. None of the above mentioned approaches is based on types. However, Takeuchi, Honda and Kubo [26] have developed a typed language for interaction, in which the type system guarantees avoidance of a class of communication errors; these errors can be viewed as weak forms of deadlock, but do not include the possibility of cyclic dependencies. Based on this work, Kobayashi, Pierce and Turner [16] ....

....of type theoretic methods for compositional verification of concurrent systems. Work is in already progress to develop a formal syntax for deadlock free processes, using ideas from the typed process calculi that we have already developed [11, 12, 20] and the typed language of Takeuchi et al. [26]. In addition, it is highly desirable to develop techniques whereby forming cyclic connections can be automated to some extent, perhaps under certain conditions. The use of variants as in Roscoe and Daithi s work [24] may provide some clues. Another possibility is the cycle sum test of Wadge [27] ....

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

....Here, by focusing on a type system and the subject reduction property, we make a further step in the specialization of the general notion of specification into that of type. Some systems that enrich in a way the notion of sort, using traces, or more generally graphs, were recently proposed [12,20,22], with various aims. Kobayashi, for instance, proposes in [12] to enrich the typing context with some information about the ordering of the use of (linear) channel names, in order to achieve a deadlock freedom property. This is somehow similar to the nesting of modalities in our system, though ....

K. Takeuchi, K. Honda, M. Kubo, An interaction-based language and its typing system, PARLE'94, Lecture Notes in Comput. Sci. 817 (1994).

.... Gamma Q 00 j (r : l 1 [Num] plusone [k; r] j r [l] s [l] The argument for the latter case is similar to part (2) These three conditions imply that R is a weak ( Theta Delta) bisimulation up to j. 2 7 Related Work The spur for our work came from a paper by Takeuchi, Honda, and Kubo [THK94] describing a modified pi calculus whose syntax guarantees that certain channels 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 ....

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proceedings of PARLE'94, pages 398--413. Springer-Verlag, 1994. Lecture Notes in Computer Science number 817.

....of analyzing confluence in pi calculus processes arising in the semantics of concurrent object oriented programs. The same problem has also been tackled by Liu and Walker, using purely semantic techniques [LW95] The immediate spur for our work came from a paper by Takeuchi, Honda, and Kubo [THK94] describing a modified pi calculus whose syntax guarantees that certain channels can only be shared between two processes. This suggested that one might try to achieve the same effect in a standard pi calculus by refining the type system. Acknowledgements Pierce is supported by the EPSRC. Turner ....

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proceedings of PARLE'94, pages 398--413. Springer-Verlag, 1994. Lecture Notes in Computer Science number 817.

....since processes can only be composed when they use common channels in a complementary way. Behavioural types. All the type systems previously referred but Yoshida s one share a property: types are static and rigid, and do not allow that names may change their behaviour. Honda et al. HVK98, THK94] propose session types that specify sequences of message types. The former are input output types; the latter embodies the former as basic types, and are constructed with a sequencing operator, and with a choice operator, giving types a branching structure. Therefore, session types are adequate ....

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Halatsis et al. [HMPT94], pages 398-413.

.... may be pragmatically useful when we try to define a semantics for a concurrent programming language where a definite notion of observation is not easily formulated, while a reduction relation can be naturally given, e.g. parallel languages with shared store or with complex interaction primitives [12, 24, 26]. We hope that the presented construction is helpful in such situations. The present exposition develops the reduction based semantic framework taking a small process calculus called calculus [7, 4, 8, 10] an offspring of calculus [20, 18] together with its extensions, as the main object of ....

Takeuchi, K., Honda, K. and Kubo, M., An Interaction-based Language and its Typing System. Proc. of PARLE'94, LNCS 817, pp.398--413, Springer-Verlag, 1994.

....nature of typed algebras, as well as suggesting a broader perspective on the varied principles of process composition and their types. On the more concrete side, the class of typed algebras encompasses a wide range of type disciplines for processes, placing extant theories such as Milner s sorting [10, 22, 27, 30, 31] and Lafont s typed nets [7, 20] on a uniform technical footing, suggesting new type disciplines of practical significance, and offering a secure basis for integration. Hopefully these constructions and results will become a cornerstone for effective utilisation of the presented framework in ....

....among those agents can preserve the important syntactic semantic properties as in the original situation, e.g. Church Rosser property in 4.2 5.1. This is essential when we think of applying the present framework to those concurrent programming languages which allow transmission of port names, cf. [2, 9, 18, 28, 29, 30, 32]. In another context, we may say this allows us to form a typed calculus with constants, just as a typed calculus with constants. We give a positive answer to this problem by showing that any typed Milner algebra can be integrated into the sorting type discipline discussed in Section 4. This ....

[Article contains additional citation context not shown here]

Takeuchi, K., Honda, K. and Kubo, M., An Interaction-based Language and its Typing System. Proc. PARLE'94, LNCS 817, pp.398--413, SpringerVerlag, 1994.

No context found.

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proc. of PARLE'94, number 817 in LNCS, pages 398--413. SpringerVerlag, 1994.

No context found.

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In PARLE'94, volume 817 of LNCS, pages 398--413. Springer-Verlag, 1994.

No context found.

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proc. of PARLE'94, number 817 in LNCS, pages 398--413. SpringerVerlag, 1994.

No context found.

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proc. of PARLE'94, number 817 in LNCS, pages 398-- 413. Springer-Verlag, 1994.

No context found.

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. volume 817 of LNCS. Springer-Verlag, 1994.

No context found.

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proc. of PARLE'94, number 817 in LNCS, pages 398--413. SpringerVerlag, 1994.

No context found.

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In C. Halatsis, D. G. Maritsas, G. Philokyprou, and S. Theodoridis, editors, PARLE '94: Parallel Architectures and Languages Europe, 6th International PARLE Conference, Proceedings, volume 817 of Lecture Notes in Computer Science. SpringerVerlag, 1994.

No context found.

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proceedings of PARLE'94, volume 817 of Lecture Notes in Computer Science, pages 398--413. Springer-Verlag, 1994.

No context found.

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In PARLE'94, vol. 817 of LNCS, pp. 398--413. Springer-Verlag, 1994.

No context found.

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In Proceedings of PARLE'94, pages 398--413. Springer-Verlag, 1994. Lecture Notes in Computer Science number 817.

No context found.

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of PARLE'94, LNCS 817, pages 398--413, 1994.

No context found.

Kaku Takeuchi, Kohei Honda, and Makoto Kubo. An interaction-based language and its typing system. In C. Halatsis, D. Maritsas, G. Philokyprou, and S. Theodoridis, editors, 6th International PARLE Conference (Athens, Greece, July 1994), volume 817 of LNCS, pages 398--413. Springer, 1994.

No context found.

K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In PARLE'94, vol. 817 of LNCS, pp. 398--413. Springer-Verlag, 1994. 27, 27 29

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