claim
active
claim:it-is-impossible-for-us-to-accept-the-claim-that-functional-languages-are-necessarily-higher-level-than-c-lindaIt is impossible for us to accept the claim that functional languages are necessarily higher-level than C-Linda.
Critique of the functional-level argument based on mental models.
Neighborhood — ranked by edge-count
Artifacts (1)
artifact
- The source article that introduces and argues for the Linda parallel programming model, comparing it to message-passing, concurrent objects, logic programming, and functional programming.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Argument that recursion equations are inappropriate for many important parallel programs.
- The central thesis of the paper, stated explicitly in the introduction.
- C-Linda code is easier to understand than the Parlog86 version [for the client-server problem].claim0.785Subjective but argued comparison.
- From Turner (1982), cited to represent the functional programming community's view and then refuted.
- Introduction, motivating the proposal.
- Linda wins the freedom to coexist peacefully with any number of base languages and computing models.concept0.774Load-bearing statement on Linda's orthogonal design principle: it doesn't meddle in computation, only coordination.