N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. In Proceedings of the 23th ACM Symposium on Principles of Programming Languages, pages 358--371, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....processes will never lead to a communication where the lengths of the tuples do not match. Additionally, input channels will only ever be used for inputting names, and output channels will only ever be used for outputting names. This input output sorting system is extended by linear channels in [KPT96]. Channel names are divided into linear channels which have to be used exactly once, and unlimited channels, which may be used more than once, or not at all. Object sorts are then of the form I (s 1 ; s n ) where I 2 f ; lg, and m2 f1;wg is a multiplicity, where 1 stands for linear ....

Naoki Kobayashi, Benjamin Pierce, and David Turner. Linearity and the pi-calculus. In Proc. POPL, 1996.

.... proof: type annotations have been added and checked with the Nomadic Pict type checker [Woj00] although this does not check the static mobile subtyping) the algorithm is more serialised; fresh channels are used for transmitting acknowledgements, making such channels linear [KPT96] and . the translation is extended to arbitrary located processes (not just source programs containing a single agent) The daemon is itself implemented as a static agent; the translation [ LP ] of a located process LP = new new new # in in in a 1 P1 . an Pn (well typed with ....

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Proceedings of POPL '96 [ACM96], pages 358--371.

....does not terminate: xy j x:y=xy A xy j x:y=xy A : Compared to the asynchronous calculus [Mil91, Bou92, HT91] ffi 0 does not provide for non replicated input agents. These are not needed for functional computation and are incompatible with uniform confluence if not restricted linearly [KPT96]. In absence of once only inputs, it is not clear if the unary restriction of ffi 0 is Turing complete. 4 Uniform Confluence We formalise the notions of a calculus, complexity, and uniform confluence as in [Nie94, NS94] and discuss their relationships. These simple concepts will prove extremely ....

Naoki Kobayashi, Benjamin Pierce, and David N. Turner. Linearity and the pi-calculus. In POPL. January 1996.

....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 processes to be expressed. It may be useful to contrast typing for calculi with the ....

....(this observation motivates the introduction of join patterns in [FG96] In the type system given such channels, e.g. print, pair and getApplet in examples 1, 3 and 4 of Section 2.3, can only be of types l LG T . The integration of global local typing with some form of linearity or receptiveness [Ama97, KPT96, San97] would allow more precise typing, and hence further optimizations, while retaining the expressiveness of general channel communication. Typing locations In the type system given location names are all of type loc. This has kind Type GE and so location names can be communicated freely between ....

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the picalculus. In Proceedings of the 23rd POPL, pages 358--371. ACM press, January 1996.

....does not terminate: xy j x:y=xy A xy j x:y=xy A : Compared to the asynchronous calculus [Mil91, Bou92, HT91] ffi 0 does not provide for non replicated input agents. These are not needed for functional computation and are incompatible with uniform confluence if not restricted linearly [KPT96]. In absence of once only inputs, it is not clear if the unary restriction of ffi 0 is Turing complete. 4 Uniform Confluence We formalise the notions of a calculus, complexity, and uniform confluence as in [Nie94, NS94] and discuss their relationships. These simple concepts will prove extremely ....

Naoki Kobayashi, Benjamin Pierce, and David N. Turner. Linearity and the picalculus. In Proceedings of the ACM Symposium on Principles of Programming Languages. The ACM Press, January 1996.

....between message passing of the asynchronous # calculus and message passing by unification, as long as only one process holds a write capability and use it once. These conditions can be statically checked in well moded concurrent logic programs [41] and in the # calculus with a linear type system [19]. When two processes communicate repeatedly, constraintbased concurrency uses streams because one fresh logical variable must be prepared for each message passing, while in the linear # calculus the same channel could be recycled as suggested in [19] When two client processes communicate with a ....

.... and in the # calculus with a linear type system [19] When two processes communicate repeatedly, constraintbased concurrency uses streams because one fresh logical variable must be prepared for each message passing, while in the linear # calculus the same channel could be recycled as suggested in [19]. When two client processes communicate with a single server in constraint based concurrency, an arbitration process should be explicitly created. A stream merger is a typical arbiter for repetitive multi client communication: merge( Ys,Zs) Zs=Ys. merge(Xs, Zs) Zs=Xs. ....

[Article contains additional citation context not shown here]

Kobayashi, N., Pierce, B. and Turner, D., Linearity and the Pi-Calculus. ACM Trans. Prog. Lang. Syst., Vol. 21, No. 5 (1999), pp. 914--947.

....a certain type safety theorem holds even if some of the processes are not welLtyped [4, 19] Types constrain the behavior of processes and their environments, and thereby allow a coarser notion of behavioral equivalence. Typed equivalence has already been investigated in various process calculi [13, 16, 17, 18]. It may be possible to develop a similar theory in 7r o. Acknowledgment First and foremost, our work benefited greatly from Naoki Kobayashi s suggestive and insightful technical advise. The TACS reviewers also gave us helpful comments on an earlier version of the present paper. Finally, we ....

N. Kobayashi, B. Pierce, and D. Turner. Linearity and the pi-calculus. In POPL'96. ACM Press, 1996.

....(touch state update channel0) cell set state values new state0) release lock) #t) Figure 4. 10: Result of optimization (continued) less extra operations could be produced by using partial evaluators for concurrent languages or by applying static analysis for concurrent programs[44, 58, 59] to the resulting code. To evaluate the efficiency of our partially evaluated meta objects, we executed benchmark programs in the following three ways: PE(partially evaluated) The default meta object was partially evaluated with respect to each benchmark program, and the generated code was ....

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Conference record of Symposium on Principles of Programming Languages, pp. 358--371, January 1996.

....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 Turner [15] have developed a linear type system for the calculus. Recently Kobayashi [14] has proposed 16 a process calculus with a type system which captures information about order of channel usage, and uses this information to guarantee deadlock freedom. In this calculus, a distinction is made between ....

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. In Proceedings, 23rd ACM Symposium on Principles of Programming Languages, 1996.

No context found.

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the Pi-Calculus. In Proceedings of ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages (POPL'96), pages 358--371. ACM Press, 1996. 17

No context found.

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the Pi-Calculus. In 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1996.

No context found.

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. ACM Trans. Prog. Lang. Syst., 21(5):914--947, 1999.

No context found.

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. In Proceedings of ACM SIGPLAN /SIGACT Symposium on Principles of Programming Languages, pages 358--371, January 1996.

No context found.

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. ACM Trans. Prog. Lang. Syst., 21(5):914--947, 1999.

No context found.

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the picalculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 358 -- 371, Jan. 1996.

No context found.

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the picalculus. In ACM SIGACT / SIGPLAN Symposium on Principles of Programming Languages, pages 358--371, January 1996.

....be used for data structures such as nested tuples, records, etc. However, such encodings do not always give rise to useful derived typing rules. In particular, when we started the Pict design, there were no type systems for the pure, monadic calculus (although more recent work on linear types [KPT96] may lead to such type systems) Therefore, we begin from a slightly more structured core language, which admits a simple, structural type system just as typed functional languages such as ML and Haskell are typically based on a calculus extended with basic data constructors. 2.3.2 ....

.... 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 restriction greatly simplifies the task of type analysis, since the well typedness of a parallel ....

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Principles of Programming Languages, 1996.

No context found.

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. In Proceedings of the 23th ACM Symposium on Principles of Programming Languages, pages 358--371, 1996.

No context found.

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. In Proceedings POPL'96, pages 358--371. ACM, 1996.

No context found.

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst., 21(5):914--947, 1999.

No context found.

Kobayashi, N., Pierce, B. and Turner, D., Linearity and the pi-calculus, POPL'96, ACM Press, 1996.

No context found.

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. In Proceedings of POPL '96, pages 358--371. ACM, Jan. 1996.

No context found.

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the picalculus. In Proceedings of POPL '96, pages 358371. ACM, January 1996.

No context found.

N. Kobayashi, B. Pierce, and D. Turner. Linearity and the pi-calculus. In POPL'96, St. Petersburg Beach, Florida, pp. 358--371. ACM Press, Jan. 1996. 26

No context found.

Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Proceedings of POPL '96 [ACM96], pages 358-371.

First 50 documents  Next 50

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