Asynchronous process calculi: The first- and higher-order paradigms

Theoretical Computer Science

Volumn 253, Issue 2, 2001, Pages 311-350

  Sangiorgi, D ^a  

^a INRIA   (France)

Author keywords

Asynchrony; First and higher order process calculi; Full abstraction

Indexed keywords

ABSTRACTING; DISTRIBUTED COMPUTER SYSTEMS;

ASYNCHRONOUS PROCESS CALCULI; ASYNCHRONY;

OBJECT ORIENTED PROGRAMMING;

EID: 0034923642     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00097-9     Document Type: Article

References (43)

1. S. Abramsky, The lazy lambda calculus, in: D. Turner (Ed.), Research Topics in Functional Programming, Addison-Wesley, Reading, MA, 1989, pp. 65-116.
2. G. Agha, Actors: a Model of Concurrent Computation in Distributed Systems, The MIT Press, Cambridge, MA, 1986.
3. R. Amadio, I. Castellani, D. Sangiorgi, in: On bisimulations for the asynchronous π-calculus, Proc. CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996.
4. R.M. Amadio, L. Cardelli, Subtyping recursive types, ACM Trans. Program. Languages Systems 15(4) (1993), 575-631. A preliminary version appeared in POPL '91 and as DEC Systems Research Center Research Report Number 62, August 1990, pp. 104-118.
5. R.M. Amadio, L. Cardelli, Subtyping recursive types, ACM Trans. Program. Languages Systems 15(4) (1993), 575-631. A preliminary version appeared in POPL '91 and as DEC Systems Research Center Research Report Number 62, August 1990, pp. 104-118.
6. M. Boreale, in: On the expressiveness of internal mobility in name-passing calculi, Proc. CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996.
7. G. Boudol, Towards a lambda calculus for concurrent and communicating systems, TAPSOFT '89, Lecture Notes in Computer Science, vol. 351, pp. 149-161, 1989.
8. G. Boudol, Asynchrony and the π-calculus, Tech. Rep. RR-1702, INRIA-Sophia Antipolis, 1992.
9. G. Boudol, The pi-calculus in direct style, Proc. 24th POPL, ACM Press, New York, 1997.
10. J. Despeyroux, Higher-order specification of the pi-calculus, to appear in Proc. IFIP TCS '2000, Japan, August 2000.
11. W. Ferreira, M. Hennessy, A. Jeffrey, A theory of weak bisimulation for core CML, Tr 95:05, School of Cognitive and Computing Sciences, University of Sussex, 1995.
12. M.J. Fischer, N.A. Lynch, M.S. Paterson, Impossibility of distributed consensus with one faulty processor, J. ACM 32 (2) (1985) 374-382.
13. C. Fournet, G. Gonthier, The reflexive chemical abstract machine and the join calculus, Proc. 23rd POPL, ACM Press, New York, 1996.
14. A. Giacalone, P. Mishra, S. Prasad, FACILE, a symmetric integration of concurrent and functional programming, in: J. Diaz, F. Orejas (Eds.), TAPSOFT '89, Lecture Notes in Computer Science, vol. 352, Springer, Berlin, 1989, pp. 189-209.
15. A.D. Gordon, G.D. Rees, Bisimilarity for a first-order calculus of objects with subtyping, Proc. 23rd POPL, ACM Press, New York, 1996.
16. C. Hewitt, Viewing control structures as patterns of passing messages, J. Artificial Intelligence 8 (3) (1977) 323-364.
17. K. Honda, Two bisimilarities for the v-calculus, Tech. Rep. 92-002, Keio University, 1992.
18. K. Honda, M. Tokoro, An object calculus for asynchronous communications, in: M. Tokoro, O. Nierstrasz, P. Wegner, A. Yonezawa (Eds.), ECOOP '91 Workshop on Object Based Concurrent Programming, Geneva, Switzerland, 1991, Lecture Notes in Computer Science, vol. 512, Springer, Berlin, 1991, pp. 133-147.
19. K. Honda, M. Tokoro, A small calculus for concurrent objects, ACM OOPS Messanger, 2 (2) (1991) 50-54.
20. K. Honda, N. Yoshida, On reduction-based process semantics, Theoret. Comput. Sci. 152 (2) (1995) 437-486.
21. D.J. Howe, Proving congruence of bisimulation in functional programming languages, Inform. Comput. 124 (2) (1996) 103-112.
22. H. Hüttel, J. Kleist, M. Merro, U. Nestmann, Migration = cloning; aliasing, to be presented at Sixth Workshop on Foundations of Object-Oriented Languages (FOOL 6), 1999.
23. B. Jonsson, J. Parrow, Deciding bisimulation equivalences for a class of non-finite-state programs, Inform. Comput. 107 (1993) 272-302.
24. M. Merro, D. Sangiorgi, On asynchrony in name-passing calculi, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)(1998), vol:1443.
25. R. Milner, The polyadic π-calculus: a tutorial, Tech. Rep. ECS-LFCS-91-180, LFCS, Department of Computer Science Edinburgh University October 1991, Also in: F.L. Bauer, W. Brauer, H. Schwichtenberg (Eds.), Logic and Algebra of Specification, Springer, Berlin, 1993.
26. R. Milner, The polyadic π-calculus: a tutorial, Tech. Rep. ECS-LFCS-91-180, LFCS, Department of Computer Science Edinburgh University October 1991, Also in: F.L. Bauer, W. Brauer, H. Schwichtenberg (Eds.), Logic and Algebra of Specification, Springer, Berlin, 1993.
27. R. Milner, Functions as processes, J. Math. Struct. Comp. Sci. 2 (2) (1992) 119-141.
28. R. Milner, D. Sangiorgi, Barbed bisimulation, in: W. Kuich (Ed.), 19th ICALP, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 685-695.
29. U. Nestmann, B. Pierce, in: Decoding choice encodings, Proc. CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996.
30. C. Palamidessi, Comparing the expressive power of the synchronous and the asynchronous pi-calculus, Proc. 24th POPL, ACM Press, New York, 1997.
31. J. Parrow, D. Sangiorgi, Algebraic theories for name-passing calculi, Inform. Comput. 120 (2) (1995) 174-197.
32. B.C. Pierce, D.N. Turner, Pict: a programming language based on the pi-calculus, Tech. Rep. CSCI 476, Indiana University, 1997, in: Gordon Plotkin, Colin Stirling, and Mads Tofte (Eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner MIT Press, Cambridge, MA, to appear.
33. J. Reppy. CML: a higher-order concurrent language, in: Programming Language Design and Implementation, SIGPLAN, ACM, 1991.
34. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D. thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992.
35. D. Sangiorgi, Lazy functions and mobile processes. Tech. Rep. RR-2515, INRIA-Sophia Antipolis, 1995, in Festschrift volume in honor of Robin Milner's 60th birthday, MIT Press, New York, to appear.
36. D. Sangiorgi, Bisimulation for higher-order process calculi, Inform. Comput. 131 (2) (1996) 141-178.
37. D. Sangiorgi, π-calculus, internal mobility and agent-passing calculi, Theor. Comput. Sci. 167 (2) (1996) 235-274.
38. D. Sangiorgi, The name discipline of receptiveness, Theoret. Comput. Sci. 221 (1999) 457-493.
39. D. Sangiorgi, Interpreting functions as pi-calculus processes: a tutorial, Revised version of TR RR-3470, INRIA-Sophia Antipolis, Available from the author's web page.
40. D. Sangiorgi, R. Milner, The problem of Weak Bisimulation up to, in: W.R. Cleveland (Ed.), Proc. CONCUR '92, Lecture Notes in Computer Science, vol. 630, Springer, Berlin, 1992, pp. 32-46.
41. B. Thomsen, Calculi for higher order communicating systems, Ph.D. Thesis, Department of Computing, Imperial College, 1990.
42. B. Thomsen, Plain CHOCS, a second generation calculus for higher-order processes, Acta Inform. 30 (1993) 1-59.
43. B. Thomsen, L. Leth, T.-M. Kuo, in: A Facile tutorial, Proc. CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996.