claim
active
claim:interpretive-abstraction-is-a-fairly-simple-programming-technique-but-it-s-only-possible-if-the-parallelism-tools-are-under-the-programmer-s-controlInterpretive abstraction is a fairly simple programming technique, but it's only possible if the parallelism tools are under the programmer's control.
Contrasts with auto-parallelizing compilers; flexibility of Linda.
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.
- Programming technique to restructure a fine-grained Linda program for efficiency by replacing live data structures with passive ones and coarser-grain processes.
- VPD is positioned as advancing a paradigm shift from top-down mechanistic interpretability (activation-based) to parameter-centric, data-driven discovery.
- Diagnosis of the state of the interpretability field, drawing on Kuhn's framework
- Fundamental design principle driving Oberon: proper abstraction enables modular structure and maintainability.
- Vision statement for Information Dynamics as emerging field transcending traditional computer science semantics.
- The capability to explain model predictions; a central theme of the paper, with disruption profiles as vehicle.
- Method using large language models (Claude) to generate and test explanations of features at scale
- Load-bearing analogy defining the aspirational goal of mechanistic interpretability