Linda is a model of process creation and coordination that is orthogonal to the base language in which it’s embedded.

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.885
  The central thesis of the paper, stated explicitly in the introduction.
• The Linda model-a swarm of active tuples surrounded by a cloud of passive ones-is suggestive in itself.claim0.839
  Comment on the conceptual elegance of the model, used in conclusion.
• Linda is a more practical and a more elegant alternative to concurrent logic programming.claim0.828
  Overall comparison conclusion against concurrent logic.
• Linda unifies process creation, inter-process communication and synchronization within tuple-space operations.claim0.827
  Key advantage: the same operations handle all three aspects of parallel coordination.
• 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.concept0.825
  Foundational principle: Linda's orthogonality to base language and computation model is its core strength.
• Linda programming language exemplifies bringing craft principles into computational systems.claim0.823
• Communication and process creation are two facets of the same operation in Linda.claim0.815
  Linda unifies process creation and communication through generative communication.
• Linda achieves scalable performance on distributed-memory machines.claim0.811
  Supported by reported speedup through 64 nodes on iPSC/2.