Xinxin Liu and David Walker. A polymorphic type system for the polyadic -calculus. In CONCUR '95: Concurrency Theory, pages 103--116. Springer, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....contains some discussion of the design space, and touches on some of the other issues mentioned above. A full treatment is beyond the scope of this paper, however, so they are not reflected in the calculus. A number of refined type systems for calculi have been studied, addressing polymorphism [FLMR97, LW95, PS97, Tur96, Vas94], directionality [Ode95, PS96] linearity and receptiveness [Ama97, KPT96, San97] deadlock freedom [Kob97] object encodings [San96] confluence [Nie96, NS97] type inference [Gay93, VH93] and other phenomena (this is far from exhaustive) Each allows some particular behavioural discipline of ....

Xinxin Liu and David Walker. A polymorphic type system for the polyadic -calculus. In Proceedings of CONCUR '95. LNCS 962, pages 103--116, 1995.

....the future. The paper presents a type system that is able to type objects with a non uniform service availability, while preserving the subject reduction property. An extended and revised version of a paper presented at Euro Par 97. 1 A typical process not typable by traditional type systems [VH93, VT93, KY95, LW95] is a one place buffer that only allows read operations when it is full, and write operations when it is empty. Empty(b) b B [ write : u) Full(b u) Full(b u) b B [ read : r) r C val : u] j Empty(b) The type systems mentioned above assign interface like types to names. Therefore, name ....

X. Liu and D. Walker. A polymorphic type system for the polyadic -calculus. In 6th International Conference on Concurrency Theory, volume LNCS 962, pages 103--116. Springer-Verlag, 1995.

....to yield a valid monomorphic typing judgement. Turner s system is different in that instantiation of type variables is internalised and can take place at runtime; the difference is similar to that between the polymorphism of Standard ML [21] and the polymorphic calculus [5, 29] Liu and Walker [12] have considered a rather different system of polymorphism, which we will not discuss further as it does not fit into the common presentational style of this article. Pierce and Sangiorgi [25] from whose paper the above example is taken) have considered the effect of Turner s system of ....

X. Liu and D. Walker. A polymorphic type system for the polyadic -calculus. In CONCUR '95: Proceedings of the International Conference on Concurrency Theory, volume 962 of LNCS. Springer-Verlag, 1995.

....translations of lambda terms into untyped pi calculus both preserve and reAEect polymorphic typing. Process calculi with weaker ML style polymorphism have been developed by Gay [Gay93] and Vasconcelos and Honda [VH93] A rather dioeerent style of polymorphism is considered by Liu and Walker [LW95]. Many other type systems have been proposed for process calculi. One that particularly invites comparison with the present system is the pi calculus with input output modalities developed by the present authors [PS93] in which the capabilities of reading and writing on channels are distinguished ....

Xinxin Liu and David Walker. A polymorphic type system for the polyadic -calculus. In CONCUR'95: Concurrency Theory, pages 103116. Springer, 1995.

....Milner s translations of lambda terms into untyped pi calculus both preserve and reflect polymorphic typing. Process calculi with weaker ML style polymorphism have been developed by Gay [Gay93] and Vasconcelos and Honda [VH93] A rather different style of system is considered by Liu and Walker [LW95]; here, polymorphism arises not from type quantification, but by explicitly declaring the possible set of types of values that a given channel may carry. Typing itself does not guarantee absence of run time errors; for this a notion of consistent type is separately introduced. Many other type ....

Xinxin Liu and David Walker. A polymorphic type system for the polyadic -calculus. In CONCUR'95: Concurrency Theory, pages 103--116. Springer, 1995.

....results. A natural question arises Is there any relationship between the two paradigms . With this motivation, the present paper gives deeper investigations on typing systems between the two approaches. For this purpose, a sorting system by name matching, a quite similar to the system in [7], and a typing system by structure matching with subtyping, a slight extension of the system in [12] are presented, along with several basic properties. Then, correspondence between the sorting system and the typing system is investigated via transformations both form sortings to typings and from ....

....by relying on the syntactical names assigned to communication channels (or names) in a given process, instead of no structure. An algorithm to infer the most general sorting of a term has been reported by Gay in [6] Milner s original idea is further extended and explored by Liu and Walker in [7], where an input sorting and an output sorting are distinguished. On the other hand, typing systems based on structure matching are introduced in [16, 12] In the structure matching (or, by structure matching) type equality or subtyping is determined by some abstract type structure, no by how ....

[Article contains additional citation context not shown here]

Liu, X., Walker, D., A polymorphic type system for the polyadic -calculus, CONCUR '95, LNCS, 962, pp.103--116, 1995.

No context found.

Xinxin Liu and David Walker. A polymorphic type system for the polyadic -calculus. In CONCUR '95: Concurrency Theory, pages 103--116. Springer, 1995.

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