Cédric Fournet
ABSTRACT
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurrency that is consistent with mobility and distribution. Our model provides the foundations of a programming language with functional and object-oriented features. It can also be seen as a process calculus, the join-calculus, which we prove equivalent to the π-calculus of Milner, Parrow and Walker.
- 1.G. Agha, I. Mason, S. Smith, and C. Talcott. A foundation for actor computation. Technical report, UIUC, 1993.Google Scholar
- 2.G. A. Agha. Actors: a Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge, MA, 1986. Google ScholarDigital Library
- 3.R. Amadio and S. Prasad. Localities and failures. Foundations of Software Technology and Theoretical Computer Science, 14, 1994.Google Scholar
- 4.J.-M. Andreoli and R. Pareschi. Communication as fair distribution of knowledge, in Proceedings OOP- SLA '91, A CM SIGPLAN Notices, pages 212-229, Nov. 1991. Published as Proceedings OOPSLA '91, ACM SIGPLAN Notices, volume 26, number 11. Google ScholarDigital Library
- 5.J.-P. Bangtre, M. Ban~tre, and F. Ployette. Distributed system structuring using multi-functions. Rapport de Recherche 694, INRIA Rennes, June 1987.Google Scholar
- 6.G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248, 1992. Google ScholarDigital Library
- 7.G. BoudoI. Asynchrony and the 7r-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992Google Scholar
- 8.L. Cardelli. A language with distributed scope. Computzng Systems, 8(1)27-59, Jan. 1995. A preliminary version appeared in Proceedings of the 22nd ACM Symposium on Principles of Programming Languages. Google ScholarDigital Library
- 9.A. Giacalone, P. Mishra, and S. Prasad. FACILE: A symmetric integration of concurrent and functional programming. Internatzonal Journal of Parallel Programmzng, 18(2):121-160, 1989. Also in TAPSOFT '89, ed. J. Diaz and F. Orejas, pp. 184-209, Springer-Verlag, Lecture Notes in Computer Science 352 (1989). Google ScholarDigital Library
- 10.K. Honda and M. Tokoro. An object calculus for asynchronous communication. In P. America, editor, Proceedings ECOOP '91, LNCS 512, pages 133-147, Geneva, Switzerland, July 15-19 1991. Springer-Verlag. Google ScholarDigital Library
- 11.K. Honda and M Tokoro. On asynchronous communication semantics. In P. W. M. Tokoro and O. Nierstrasz, editors, Proceedzngs of the ECOOP '91 Workshop on Object-Based Concurrent Computing, LNCS 612, pages 21-51. Springer-Verlag, 1992. Google ScholarDigital Library
- 12.K. Honda and N. Yoshida. On reduction-based process semantics. Foundations of Software Technology and Theoretical Computer Science, 13, 1993 Google ScholarDigital Library
- 13.K. Honda and N. Yoshida. Combinatory representation of mobile processes. In Proceedings POPL '94, 1994. Google ScholarDigital Library
- 14.N. Kobayashi, B. C Pierce, and D. N. Turner. Linearity and the pi-calculus. In Proceedings POPL '96, 1996. Google ScholarDigital Library
- 15.L. Maranget. Two techniques for compiling lazy pattern matching. Research report 2385, INRIA, 1994.Google Scholar
- 16.R. Milner. Commun#catzon and Concurrency. Prentice Hall, New York, 1989. Google ScholarDigital Library
- 17.R. Milner. Functions as processes, in Automata, Languages and Programming 17th Int. Coll., volume 443 of LNCS, pages 167-180. Springer Verlag, July 1990 Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 19.R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and iI. Information and Cornputat#on, pages 1-40 & 41-77, Sept. 1992. Google ScholarDigital Library
- 20.R. Milner and D. Sangiorgi. Barbed bisimulation. In Proceedings ICALP '92, LNCS 623, pages 685-695, Vienna, 1992. Springer-Verlag. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 23.B. C. Pierce and D. N. Turner. Concurrent objects in a process calculus. In T. Ito and A. Yonezawa, editors, Theory and Practice of Parallel Programming (TPPP), Sendal, Japan (Nov. 199# ), number 907 in Lecture Notes in Computer Science, pages 187-215. Springer- Verlag, Apro 1995. Google ScholarDigital Library
- 24.B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. Technical report in preparation, 1995.Google Scholar
- 25.D. Sangiorgi and R. Milner. The problem of "weak bisimulation up to". In W. R. Cleaveland, editor, Proceedings of CONCUR'92, LNCS 630, pages 32-46. Springer-Verlag, 1992. Google ScholarDigital Library
- 26.G. Smolka. A foundation for higher-order concurrent constraint programming. In J.-P. Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, vol. 845, pages 50-72, Mfinchen, Germany, 7-9 Sept. 1994. Springer-Verlag. Google ScholarDigital Library
- 27.D. N. Turner. The #-calcuIus: Types, polymorphism and #mplementation. PhD thesis, LFCS, University of Edinburgh, 1995. In preparation.Google Scholar
- 28.D. Walker. Objects in the pi-calculus. Information and Computation, 116(2):253-271, 1995. Google ScholarDigital Library
Index Terms
- The reflexive CHAM and the join-calculus
Recommendations
A transactional object calculus
A transaction defines a locus of computation that satisfies important concurrency and failure properties. These so-called ACID properties provide strong serialization guarantees that allow us to reason about concurrent and distributed programs in terms ...
A refinement calculus for logic programs
Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming ...
Comments