The Linda model doesn't care how the multiple execution threads in a Linda program compute what they compute; it deals only with how these execution threads are created and organized into a coherent program.

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

• Linda is a simpler, more powerful and more elegant model than any of these four alternatives (message-passing, concurrent objects, logic languages, functional).claim0.841
  The central thesis of the paper, stated explicitly in the introduction.
• Linda is a model of process creation and coordination that is orthogonal to the base language in which it’s embedded.quote0.825
  Load-bearing definition of Linda's relation to the base language.
• The Linda code is insensitive to the number of clients, whereas Parlog requires a merge process that depends on the count.claim0.809
  Demonstrates flexibility advantage.
• Linda achieves scalable performance on distributed-memory machines.claim0.809
  Supported by reported speedup through 64 nodes on iPSC/2.
• The Actors model covers fewer programming patterns than Linda, but in a more complicated way.claim0.808
  Critique that Actors is less expressive yet more complex.
• Linda can express fine-grained wavefront computations cleanly; future implementations on next-generation machines can support them efficiently.hypothesis0.807
• Linda is a more practical and a more elegant alternative to concurrent logic programming.claim0.802
  Overall comparison conclusion against concurrent logic.
• It is easy to express a wavefront computation in Linda: we use eval to create one process for each element, and rd to read the preceding counter-diagonal.claim0.794
  Illustrates how live data structures are simply expressed.