Solo diagrams

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

Volumn 2215, Issue , 2001, Pages 127-144

  Laneve, Cosimo ^a   Parrow, Joachim ^b   Victor, Björn ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; SEMANTICS;

FUSION CALCULUS; GRAPHIC REPRESENTATION; INTERACTION DIAGRAM; MOBILE PROCESS; REDUCTION RULES; UNFOLDING SEMANTICS;

CALCULATIONS;

EID: 84978971034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_6     Document Type: Conference Paper

References (22)

1. G. Bellin and P. Scott. On the π-calculus and linear logic. Theoretical Computer Science, 135: 11-65, 1994.
2. G. Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
3. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proc. of POPL '96, pages 372-385. ACM, Jan. 1996.
4. Y. Fu. A proof-theoretical approach to communication. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of ICALP '97, volume 1256 of LNCS, pages 325-335. Springer, 1997.
5. Y. Fu. Reaction graph. Journal of Computer Science and Technology, Science Press, China, 13(6): 510-530, 1998.
6. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.
7. G. Gonthier, M. Abadi, and J.-J. Lévy. The geometry of optimal lambda reduction. In Proc. of POPL '92, pages 15-26. ACM Press, 1992.
8. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In P. America, editor, Proc. of ECOOP '91, volume 512 of LNCS, pages 133-147. Springer, July 1991.
9. Y. Lafont. Interaction nets. In Proc. of POPL '90, pages 95-108. ACM Press, 1990.
10. C. Laneve and B. Victor. Solos in concert. In J. Wiederman, P. van Emde Boas, and M. Nielsen, editors, Proc. of ICALP '99, volume 1644 of LNCS, pages 513-523. Springer, July 1999.
11. C. Laneve and B. Victor. Solos in concert. Full version of [10], submitted for journal publication, February 2001.
12. R. Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2): 119-141, 1992.
13. R. Milner. The polyadic π-calculus: A tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, volume 94 of Series F. NATO ASI, Springer, 1993.
14. R. Milner. Pi-nets: A graphical form of π-calculus. In D. Sannella, editor, Proc. of ESOP '94, volume 788 of LNCS, pages 26-42. Springer, 1994.
15. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part I/II. Information and Computation, 100: 1-77, Sept. 1992.
16. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Proc. of ICALP '92, volume 623 of LNCS, pages 685-695. Springer, 1992.
17. J. Parrow. Interaction diagrams. Nordic Journal of Computing, 2: 407-443, 1995.
18. J. Parrow. Trios in concert. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing. MIT Press, May 2000.
19. J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proc. of LICS '98, pages 176-185. IEEE, Computer Society Press, July 1998.
20. B. C. Pierce and D. N. Turner. Pict: A programming language based on the picalculus. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing. MIT Press, May 2000.
21. D. Sangiorgi. On the bisimulation proof method. Mathematical Structures in Computer Science, 8(5): 447-479, 1998.
22. N. Yoshida. Graph notation for concurrent combinators. In T. Ito and A. Yonezawa, editors, Proc. of TPPP '94, volume 907 of LNCS, pages 393-412. Springer, 1995.