On the incomparability of Gamma and Linda

We compare Gamma and Linda, two of the most prominent coordination languages based on generative communication via a shared data space. In Gamma computation is obtained by applying multiset rewriting rules, reminiscent of the way chemical reactions happen in a solution. On the other hand, Linda permits interprocess communication by means of the creation and consumption of shared data. Also a non-blocking input operator is allowed: it terminates indicating if the required datum has been consumed or it is not actually available. We first recall two simple calculi based on Gamma and Linda coordination models. Even if both the languages are Turing powerful, we show that their expressive power is not comparable; in particular, we prove that there exists no program distribution preserving encoding of one language in the other that respects at least the input-output behaviour.

[1]  Frank S. de Boer,et al.  Embedding as a Tool for Language Comparison: On the CSP Hierarchy , 1991, CONCUR.

[2]  Gianluigi Zavattaro,et al.  Towards a Hierarchy of Negative Test Operators for Generative Communication , 1998, EXPRESS.

[3]  Chris Hankin,et al.  A Parallel Programming Style and Its Algebra of Programs , 1993, PARLE.

[4]  Roberto Gorrieri,et al.  On the Turing equivalence of Linda coordination primitives , 1999, EXPRESS.

[5]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[6]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[7]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[8]  Roberto Gorrieri,et al.  Comparing three semantics for Linda-like languages , 2000, Theor. Comput. Sci..

[9]  Jean-Marie Jacquet,et al.  On the Expressiveness of Linda-like Concurrent Languages , 1998, EXPRESS.

[10]  Roberto Gorrieri,et al.  Three Semantics of the Output Operation for Generative Communication , 1997, COORDINATION.

[11]  Roberto Gorrieri,et al.  A Process Algebraic View of Linda Coordination Primitives , 1998, Theor. Comput. Sci..

[12]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and the asynchronous π-calculus , 1998, POPL '97.

[13]  Daniel Le Métayer,et al.  Programming by multiset transformation , 1993, CACM.

[14]  Roberto Gorrieri,et al.  An alternative semantics for the parallel operator of the calculus of gamma programs , 1996 .

[15]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.