Linda is a more practical and a more elegant alternative to concurrent logic programming.

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.
• Linda programming language exemplifies bringing craft principles into computational systems.claim0.849
• Linda is a model of process creation and coordination that is orthogonal to the base language in which it’s embedded.quote0.828
  Load-bearing definition of Linda's relation to the base language.
• 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.802
  Foundational principle: Linda's orthogonality to base language and computation model is its core strength.
• Linda achieves scalable performance on distributed-memory machines.claim0.795
  Supported by reported speedup through 64 nodes on iPSC/2.
• Linda is portable across a wide range of parallel machines.claim0.794
  Claim supported by the list of implemented platforms.
• The Linda code is insensitive to the number of clients, whereas Parlog requires a merge process that depends on the count.claim0.793
  Demonstrates flexibility advantage.
• C-Linda code is easier to understand than the Parlog86 version [for the client-server problem].claim0.792
  Subjective but argued comparison.