S. J. Gay. A sort inference algorithm for the polyadic -calculus. In Proceedings, 20th ACM Symposium on Principles of Programming Languages. ACM Press, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....step we determine the assignment of sorts to names and the mapping ob . This may be done by representing ob as a graph and refining ob step by step by collapsing graph nodes every time we encounter a constraint of the form ob(s) s. Or we can use the sort inference algorithm by Simon Gay [5]. In the second step we compute the monoid elements by induction on the structure of P . In this case the typing rules are already very constructive, the main complication arises from typing rule (T REP) Here we require that the monoid I satisfies the condition stated above. So (because of ....

Simon J. Gay. A sort inference algorithm for the polyadic -calculus. In Proc. of POPL `93. ACM, 1993.

....first step we determine the assignment of sorts to names and the mapping ob . This may be done by representing ob as a graph and refining ob step by step by collapsing graph nodes every time we encounter a constraint of the form ob(s) s. Or we can use the sort inference algorithm by Simon Gay [5]. In the second step we compute the monoid elements by induction on the structure of P . In this case the typing rules are already very constructive, the main complication arises from typing rule (T REP) Here we require that the monoid I satisfies the condition stated above. So (because of ....

Simon J. Gay. A sort inference algorithm for the polyadic -calculus. In Proc. of POPL `93. ACM, 1993.

....in volume 1302 of Lecture Notes on Computer Science, pages 187 201. 1 correctness of programs or to perform non trivial code optimization, such as elimination of redundant communication. Type Systems for Process Calculi. In order to overcome the above problems, a number of type systems [Gay93, VH93, PS93, KPT96, Kob98, PS97] have been studied through process calculi. Among them, Pierce and Sangiorgi s input only output only channel type system with subtyping [PS93] and Kobayashi, Pierce, and Turner s linear type system [KPT96] come up with re ned process equivalence theories, thus making it easier to reason about ....

....For example, the process x [z] y [z] receives a value along the channel x and then forwards it to the channel y. The process x [z] y [z] represents an in nite number of parallel copies of x [z] y [z] so that it repeatedly forwards values received along x to y. Earlier type systems [Gay93, VH93] for concurrent languages (including CML [Rep91] were only concerned with the types of values transmitted along channels; so both f [x] x [1] and f [x] x [n] 0 are well typed under the type environment f : Int ] where [ denotes the type of channels used for transmitting values of type ....

Simon J. Gay. A sort inference algorithm for the polyadic -calculus. In ACM SIGACT / SIGPLAN Symposium on Principles of Programming Languages, pages 429-438, 1993.

.... 21 Introduction 1 1 Introduction Following its early success as a framework for the investigation of the foundations of various concurrent programming styles, the calculus [7] has also become established as a vehicle for the exploration of type systems for concurrent programming languages [1, 4, 5, 6, 9, 13]. Inter process communication in the calculus is based on point to point transmission of messages along named channels, and many proposed type systems have started from the assignment of types to channels, so that the type of a channel determines what kind of message it can carry. Because ....

....server = x . fplus : x [a : int] x [b : int] x [a b] 0; negate : x [a : int] x [ a] 0g newserver = thread client1body = y negate : y [2] y [a : int] 0 client1 = y : S)trigger [y ] client1body client2body = z plus : z [1] : z [2] z [b : int] 0 client2 = z : S)trigger [z ] client2body Now trigger : b[S] newserver j client1 j client2 is a valid typing judgement. Or, to nish the derivation of a complete program ( trigger : b[S] newserver j client1 j client2) Because trigger does not ....

S. J. Gay. A sort inference algorithm for the polyadic -calculus. In Proceedings, 20th ACM Symposium on Principles of Programming Languages. ACM Press, 1993.

....when I was a PhD student at Imperial College, London, under the supervision of Professor Samson Abramsky. Initially I studied the calculus [24] and in particular the system of sorting proposed by Milner [23] This work led to the development of a sort inference algorithm for the calculus [9], which continues to be cited in the literature on types for the calculus. Later my research moved in the direction of interaction categories, a semantic framework for typed concurrency proposed by Abramsky [1, 2, 4, 5] My PhD thesis [11] dealt with the theory and applications of interaction ....

....names as data) and the type of a channel is a tuple of types. Thus types have a recursive structure, ensuring that the receiver of a name will use it in the same way as the sender. This system has a notion of principal type, and type inference is possible in a similar way to functional languages [9, 15]. The kind of runtime errors which are avoided are attempts to receive a tuple of the wrong size. Pierce and Sangiorgi [26] re ned Milner s type system by introducing a distinction between input and output channels. The fact that a process respects a certain typing then provides a more accurate ....

S. J. Gay. A sort inference algorithm for the polyadic -calculus. In Proceedings, 20th ACM Symposium on Principles of Programming Languages. ACM Press, 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