(Enter summary)
Abstract: The economy and flexibility of the pi-calculus make it an attractive object of theoretical
study and a clean basis for concurrent language design and implementation.
However, such generality has a cost: encoding higher-level features like functional computation
in pi-calculus throws away potentially useful information. We show how a linear
type system can be used to recover important static information about a process's
behavior. In particular, we can guarantee that two processes communicating... (Update)
Cited by: More
Secrecy by Typing in Security Protocols - Abadi (1998)
(Correct)
Mobility Types for Mobile Ambients - Cardelli, Ghelli, Gordon (1999)
(Correct)
CLL: A Concurrent Language Built from Logical Principles - Garg (2005)
(Correct)
Similar documents (at the sentence level):
35.6%: Linearity and the Pi-Calculus - Kobayashi, Pierce, Turner (1996)
(Correct)
Active bibliography (related documents): More All
0.6: Pict: A Programming Language Based on the Pi-Calculus - Pierce, Turner (1997)
(Correct)
0.4: Behavioral Equivalence in the Polymorphic Pi-Calculus - Benjamin C. Pierce, Davide .. (1996)
(Correct)
0.3: Global/Local Subtyping for a Distributed π-calculus - Sewell (1997)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: Operational Interpretations of Linear Logic - Turner, Wadler (1998)
(Correct)
0.1: Local Type Inference - Pierce, Turner (1998)
(Correct)
0.1: Type-Based Analysis Of Usage Of Values For Concurrent.. - Igarashi (1997)
(Correct)
Related documents from co-citation: More All
52: Information and Computation (context) - Milner, Parrow et al. - 1992
43: A partially deadlock-free typed process calculus
- Kobayashi - 1997
40: Pict: A programming language based on the pi-calculus
- Pierce, Turner - 1997
BibTeX entry: (Update)
Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Principles of Programming Languages, 1996. http://citeseer.ist.psu.edu/article/kobayashi98linearity.html More
@article{ kobayashi99linearity,
author = "Naoki Kobayashi and Benjamin C. Pierce and David N. Turner",
title = "Linearity and the {Pi-Calculus}",
journal = "ACM Transactions on Programming Languages and Systems",
volume = "21",
number = "5",
pages = "914--947",
year = "1999",
url = "citeseer.ist.psu.edu/article/kobayashi98linearity.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
854
Information and Computation (context) - Milner, Parrow et al. - 1992
673
Actors: a Model of Concurrent Computation in Distributed Sys.. (context) - Agha - 1986
294
An object calculus for asynchronous communication
- Honda, Tokoro - 1991
291
A calculus of mobile agents
- Fournet, Gonthier et al. - 1996
248
Expressing Mobility (context) - Sangiorgi - 1992
233
Computational interpretations of linear logic
- Abramsky - 1993
215
Theoretical Computer Science (context) - Girard - 1987
200
Viewing control structures as patterns of passing messages (context) - Hewitt - 1977
197
Barbed bisimulation
- Milner, Sangiorgi - 1992
127
Information and Computation (context) - Walker, the - 1995
119
Facile: A Symmetric Integration of Concurrent and Functional.. (context) - Giacalone, Mishra et al. - 1989
99
Typed concurrent objects
- Vasconcelos - 1994
86
A partially deadlock-free typed process calculus
- Kobayashi - 1998
81
Once upon a type
- Turner, Wadler et al. - 1995
73
The reflexive chemical abstract machine and the join-calculu.. (context) - Fournet, Gonthier - 1996
73
Is there a use for linear logic (context) - Wadler - 1991
67
Composing processes
- Honda - 1996
61
Weak Bisimulation up to (context) - Sangiorgi, Milner et al. - 1992
52
The lazy lambda calculus in a concurrency scenario
- Sangiorgi - 1994
48
Types for dyadic interaction
- Honda - 1993
47
Lilac: A functional programming language based on linear log.. (context) - Mackie - 1994
47
volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
44
An interaction-based language and its typing system
- Takeuchi, Honda et al. - 1994
40
CML: A higher-order concurrent language (context) - Reppy - 1991
39
A pi-calculus semantics for an object-based design notation (context) - Jones - 1993
36
Interaction categories and the foundations of typed concurre..
- Abramsky, Gay et al. - 1994
35
Combinatory representation of mobile processes
- Honda, Yoshida - 1994
34
Static analysis of communication for asynchronous concurrent..
- Kobayashi, Nakade et al. - 1995
33
Type-theoretic foundations for concurrent object-oriented pr.. (context) - Kobayashi, Yonezawa - 1994
29
Syntactic control of interference revisited
- O'Hearn, Takeyama et al. - 1995
27
Principal typing schemes in a polyadic pi-calculus (context) - Vasconcelos, Honda - 1993
24
A sort inference algorithm for the polyadic ß-calculus (context) - Gay - 1993
23
Higher-order concurrent programs with finite communication t.. (context) - Nielson, Nielson - 1994
22
Functional computation as concurrent computation
- Niehren - 1996
21
Towards foundations for concurrent object-oriented programmi.. (context) - Kobayashi, Yonezawa - 1995
20
Polarized name passing (context) - Odersky - 1995
19
A typed calculus of synchronous processes
- Gay, Nagarajan - 1995
15
Lively linear lisp -- look ma (context) - Baker - 1992
14
An investigation into functions as processes
- Sangiorgi - 1993
14
Type-based analysis of usage of communication channels for c.. (context) - Igarashi, Kobayashi - 1997
14
Static and dynamic processor allocation for higher-order con..
- Nielson, Nielson - 1995
12
Confluence of processes and systems of objects (context) - Liu, Walker - 1995
9
On bisimulations for the asynchronous pi-calculus
- Amadio, Castellani et al. - 1996
7
A polymorphic type system for the polyadic ß- calculus (context) - Liu, Walker - 1995
7
The Polymorphic Pi-calulus: Theory and Implementation (context) - Turner - 1995
5
Universitat Erlangen-Nurnberg (context) - Steffen, Nestmann et al. - 1995
5
Lolli: An extension of Prolog with linear context management (context) - Hodas - 1992
1
Typed pi-calculus at work: a proof of jones's parallization .. (context) - Sangiorgi - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://para.inria.fr/~lefessan/biblio/publi.html): More
An Implementation of Complete, Asynchronous.. - Le Fessant, Piumarta, .. (1998)
(Correct)
Modelling IP Mobility - Amadio, Prasad (1998)
(Correct)
Cyclic Distributed Garbage Collection with Group Merger - Rodrigues, Jones (1997)
(Correct)
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