Abstract : We investigate concurrency as unifying computational paradigm which integrates functional, constraint, and object-oriented programming. We propose the Rho-calculus as a uniform foundation of concurrent computation and formally relate it to other models: The Rho-calculus with equational constraints provides for logic variables and is bisimilar to the Gamma-calculus. The Rho-calculus without constraints is a proper subset of the Pi-calculus. We prove its Turing completeness by embedding the eager Lambda-calculus in continuation passing style. The Rho-calculus over an arbitrary constraint system is an extension of the standard cc-model with procedural abstraction.
Type de document :
Communication dans un congrès
Kanchanasut, Kanchana and Lévy, Jean-Jacques. Asian Computing Science Conference, 1995, Pathumthani, Thailand. Springer, 1023, pp.171--186, 1995, Lecture Notes on Computer Science
https://hal.inria.fr/inria-00536813
Contributeur : Joachim Niehren
<>
Soumis le : jeudi 18 novembre 2010 - 17:34:03
Dernière modification le : mardi 31 octobre 2017 - 14:22:18
Document(s) archivé(s) le : samedi 19 février 2011 - 02:50:23
Joachim Niehren, Martin Müller. Constraints for Free in Concurrent Computation. Kanchanasut, Kanchana and Lévy, Jean-Jacques. Asian Computing Science Conference, 1995, Pathumthani, Thailand. Springer, 1023, pp.171--186, 1995, Lecture Notes on Computer Science. 〈inria-00536813〉
