claim

active

claim:the-strengths-of-all-three-models-concurrent-oop-logic-functional-are-irrelevant-to-parallelism-and-generally-unhelpful-in-dealing-with-process-creation-and-coordination

The strengths of all three models (concurrent OOP, logic, functional) are irrelevant to parallelism, and generally unhelpful in dealing with process creation and coordination.

Assertion that the popular models add nothing to parallel programming.

Source paper

extracted_from

Linda in context

(1989) · Carrier, Nicholas · Gelernter, David

Neighborhood — ranked by edge-count

Artifacts (1)

artifact

Linda in Context (1989)
about
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 edge

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

Object-oriented programming is powerful and attractive, but irrelevant to parallelism.claim0.817
Claim that OOP per se does not solve any parallel programming problems.
Object-oriented concepts are irrelevant to solving parallel programming challenges.claim0.803
Strong assertion that the enthusiasm for 'concurrent object-oriented programming' is misplaced; objects do not inherently help with parallelism.
The ability to represent relationships (e.g. correlations or associations) among variables, rather than a system of independent variables, is essential for any connectionist model of cognition.claim0.794
Necessary condition for connectionist cognition.
Explicitly parallel programs are not inherently harder to design or understand than functional specifications.claim0.791
C-Linda DNA comparison is comparable in length and clarity to Crystal; pragmatic runtime granularity control outweighs compiler optimization ideals.
Object models in which time, versioning, causality, etc., are significant are probably far better modelled by considering the time component as another key rather than an intrinsic property of the underlying model.claim0.785
Claim that orthogonal dimensions like time should be explicit keys in the associative model.
Connectionist models of cognition and learning identify conditions where collective intelligence can arise bottom-up, using only distributed learning mechanisms without system-level or global feedback.claim0.782
Central claim about the power of connectionism.
Pure functional languages cannot be the whole story for parallel programming because they fail to provide needed expressivity.claim0.781
Argument that recursion equations are inappropriate for many important parallel programs.
Parallel programming needn't be terribly difficult, but 'thinking in simultaneities' as in message-passing is calculated to make it difficult.claim0.779
Asserts that Linda's uncoupled style reduces cognitive load.