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.

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

• Linda can express fine-grained wavefront computations cleanly; future implementations on next-generation machines can support them efficiently.hypothesis0.862
• 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.794
  Foundational principle: Linda's orthogonality to base language and computation model is its core strength.
• Linda is a simpler, more powerful and more elegant model than any of these four alternatives (message-passing, concurrent objects, logic languages, functional).claim0.784
  The central thesis of the paper, stated explicitly in the introduction.
• wavefront computationconcept0.777
  Parallel pattern where elements are computed along counter-diagonals, used in DNA sequence similarity.
• The Linda code is insensitive to the number of clients, whereas Parlog requires a merge process that depends on the count.claim0.771
  Demonstrates flexibility advantage.
• Communication and process creation are two facets of the same operation in Linda.claim0.770
  Linda unifies process creation and communication through generative communication.
• C-Linda code is easier to understand than the Parlog86 version [for the client-server problem].claim0.765
  Subjective but argued comparison.
• We evaluate the relative life of a process by making predictions based on thought-experiments or simulations.claim0.765