The fact that senders in Linda needn’t know anything about receivers and vice versa is central to the language. It promotes what we call an uncoupled programming style.

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• The fact that senders in Linda needn't know anything about receivers and vice versa is central to the language.claim0.945
  Claims the uncoupled style is a key advantage.
• Communication and process creation are two facets of the same operation in Linda.claim0.798
  Linda unifies process creation and communication through generative communication.
• Uncoupled programming style eliminates the need to know receiver identity, making parallel programming easier.claim0.787
  Core argument for why Linda's model simplifies parallel programming.
• The Linda code is insensitive to the number of clients, whereas Parlog requires a merge process that depends on the count.claim0.785
  Demonstrates flexibility advantage.
• In Linda, no separate merge process is needed for multiple client streams.claim0.774
  Linda's tuple space allows many-to-one communication without an extra merger.
• Linda is a simpler, more powerful and more elegant model than any of these four alternatives (message-passing, concurrent objects, logic languages, functional).claim0.769
  The central thesis of the paper, stated explicitly in the introduction.
• Linda wins the freedom to coexist peacefully with any number of base languages and computing models.concept0.767
  Load-bearing statement on Linda's orthogonal design principle: it doesn't meddle in computation, only coordination.
• Linda can express fine-grained wavefront computations cleanly; future implementations on next-generation machines can support them efficiently.hypothesis0.766