|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
G. Agha, I. Mason, S. Smith, and C. Talcott. A foundation for actor computation. Technical report, UIUC, 1993.
|
| |
2
|
|
| |
3
|
R. Amadio and S. Prasad. Localities and failures. Foundations of Software Technology and Theoretical Computer Science, 14, 1994.
|
 |
4
|
|
| |
5
|
J.-P. Bangtre, M. Ban~tre, and F. Ployette. Distributed system structuring using multi-functions. Rapport de Recherche 694, INRIA Rennes, June 1987.
|
| |
6
|
|
| |
7
|
G. BoudoI. Asynchrony and the 7r-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992
|
 |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
 |
13
|
|
 |
14
|
Naoki Kobayashi , Benjamin C. Pierce , David N. Turner, Linearity and the pi-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.358-371, January 21-24, 1996, St. Petersburg Beach, Florida, United States
[doi> 10.1145/237721.237804]
|
| |
15
|
L. Maranget. Two techniques for compiling lazy pattern matching. Research report 2385, INRIA, 1994.
|
| |
16
|
|
| |
17
|
|
| |
18
|
R. Milner. The polyadic 7r-calculus: a tutorlal. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer Verlag, 1993.
|
| |
19
|
|
| |
20
|
|
| |
21
|
B. C. Pierce, D. R#my, and D. N. Turner. A typed higher-order programming language based on the picalculus. In Workshop on Type Theory and its Apphcation to Computer Systems, Kyoto University, July 1993.
|
| |
22
|
B. C. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 1995. To appear. A summary was presented at LICS '93.
|
| |
23
|
|
| |
24
|
B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. Technical report in preparation, 1995.
|
| |
25
|
|
| |
26
|
|
| |
27
|
D. N. Turner. The #-calcuIus: Types, polymorphism and #mplementation. PhD thesis, LFCS, University of Edinburgh, 1995. In preparation.
|
| |
28
|
|
CITED BY 91
|
|
|
|
|
Martín Abadi , Cédric Fournet , Georges Gonthier, Authentication primitives and their compilation, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.302-315, January 19-21, 2000, Boston, MA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Karol Ostrovsky , K. V. S. Prasad , Walid Taha, Towards a primitive higher order calculus of broadcasting systems, Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.2-13, October 06-08, 2002, Pittsburgh, PA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Naoki Kobayashi , Benjamin C. Pierce , David N. Turner, Linearity and the pi-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.358-371, January 21-24, 1996, St. Petersburg Beach, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Alberto Baragatti , Roberto Bruni , Hernán Melgratti , Ugo Montanari , Giorgio Spagnolo, Prototype Platforms for Distributed Agreements, Electronic Notes in Theoretical Computer Science (ENTCS), v.180 n.2, p.21-40, June, 2007
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lukasz Ziarek , Suresh Jagannathan , Matthew Fluet , Umut A. Acar, Speculative N-Way barriers, Proceedings of the 4th workshop on Declarative aspects of multicore programming, January 20-20, 2009, Savannah, GA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|