On asynchrony in name-passing calculi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 856-867

  Merro, Massimo ^a   Sangiorgi, Davide ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BIOMINERALIZATION; DIFFERENTIATION (CALCULUS);

ALGEBRAIC THEORIES; CALL-BY-NAME; DELAYED INPUT; JOIN CALCULUS; LAMBDA CALCULUS; NAME PASSING CALCULI; OPTIMISATIONS; PI CALCULUS;

CALCULATIONS;

EID: 85026563474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055108     Document Type: Conference Paper

References (25)

1. S. Abramsky. Proofs as Processes. Theoretical Computer Science, 135(1):5-9, December 1994.
2. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In Proc. CONCUR '96, LNCS 1119, Springer Verlag, 1996.
3. G. Bellin and P. Scott. On the π-calculus and Linear Logic. Theoretical Computer Science, 135(1):11-65, 1994.
4. M. Boreale. On the expressiveness of internal mobility in name-passing calculi. In Proc. CONCUR '96, LNCS 1119, Springer Verlag, 1996.
5. M. Boreale, C. Fournet, and C. Laneve. Bisimulations for the Join Calculus. Proc. IFIP Conference PROCOMET'98, 1997.
6. M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. To appear in Proc. LICS'98, IEEE Computer Society Press., 1998.
7. G. Boudol. Some Chemical Abstract Machines. LNCS 803, Springer Verlag, 1994.
8. G. Boudol. The pi-calculus in direct style. In 24th POPL. ACM Press, 1997.
9. Fournet C. and Gonthier G. The Reflexive Chemical Abstract Machine and the Join calculus. In Proc. 23th POPL. ACM Press, 1996.
10. Y. Fu. A proof theoretical approach to communication. In 24th ICALP, LNCS 1256, Springer Verlag, 1997.
11. M. Hansen, H. Hüttel, and J. Kleist. Bisimulations for asynchronous mobile processes. In Proc. Tbilisi Symposium on Language, Logic, and Computation, 1996. Also available as BRICS Report No. EP-95-HHK, BRICS, Aalborg.
12. K. Honda and M. Tokoro. A Small Calculus for Concurrent Objects. In OOPS Messanger, Association for Computing Machinery. 2(2):50-54, 1991.
13. K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In Proc. ECOOP'91, LNCS 512, Springer Verlag, 1991.
14. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437-486, 1995.
15. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991.
16. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1-77, 1992.
17. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, 19th ICALP, LNCS 623, Springer Verlag, 1992.
18. J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. To appear in Proc. LICS'98, IEEE CSP, 1998.
19. B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. To appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press.
20. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, University of Edinburgh, 1992.
21. D. Sangiorgi. Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science, 155:39-83, 1996.
22. D. Sangiorgi. π-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science, 167(2):235-274, 1996.
23. D. Sangiorgi. The name discipline of receptiveness. In 24th ICALP, LNCS 1256, Springer Verlag, 1997.
24. F. van Breugel. A Labelled Transition System for the ire-calculus. In Proc. of TAPSOFT '97, LNCS 1214. Springer Verlag, April 1997.
25. N. Yoshida. Minimality and Separation Results on Asynchronous Mobile Processes: representability theorem by concurrent combinators. Submitted, 1998.