claim

active

claim:when-a-problem-has-a-simple-solution-a-useful-system-will-give-programmers-access-to-the-simple-solution-parlog-forces-complex-solutions-to-simple-problems

When a problem has a simple solution, a useful system will give programmers access to the simple solution; Parlog forces complex solutions to simple problems.

Critique that Parlog's abstraction level is too high and restrictive.

Source paper

extracted_from

Linda in context

(1989) · Carrier, Nicholas · Gelernter, David

Neighborhood — ranked by edge-count

Communities (3)

community

Design principles for care-centered systems
members_of
Cross-scale frameworks linking spatial patterns, diagrams, and simplicity as expressions of care in design.
Linda and coordination-oriented programming systems
members_of
Tuple space coordination languages (Linda, Parlog) enabling scalable parallel systems with composable specifications, circa 1980s–90s multicomputer platforms.
Denotational design for GUIs
members_of
Conal Elliott's approach: derive library APIs from precise mathematical models of meaning

Concepts (1)

concept

Dining Philosophers Problem
about
A classic concurrency benchmark problem used to test expressivity of parallel programming primitives; second main example for Parlog-Linda comparison.

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.

Simple problems require systems that expose simple solutions; forcing complex solutions signals misaligned abstraction level.claim0.816
Parlog's merge process for client-server is unnecessarily complex; Linda's tuple operations remain flexible across problem variants.
Viewing the system as a collection of applications is a valid and useful approach.claim0.797
Foundational assumption for the pattern language.
A fast implementation of this primitive, possibly in hardware, could be the basis of efficient and compact implementations of a diverse range of programming language semantics and data structures.claim0.790
Claim that hardware-supported associative lookup would enable high-performance dynamic language runtimes.
Any cognitive glue must solve the same kind of problem that the price system solves in broadly the same way that the price system solves itclaim0.787
Necessary condition for cognitive glues.
Forcing complex solutions to simple problems indicates a language has chosen the wrong abstraction level for its primitives.claim0.779
General principle illustrated by the dining philosophers comparison.
In some sense, this is the simplest language model we profoundly don't understand. And so it makes a natural target for our paper.quote0.773
Articulates why a one-layer transformer with MLP is the appropriate starting target for mechanistic interpretability
Independently of any possibility for hardware support, the association primitive is useful to understand the semantics and complexity of a particular application mechanism and to compare and contrast different mechanisms.claim0.770
Claim that the model has value as a semantic analysis tool even without performance gains.
If systems are designed with proper purpose-oriented abstractions expressed in appropriate language, then modular structure with guaranteed reliability becomes achievable.hypothesis0.769
Core hypothesis underlying Oberon design; validated by the system's successful modularity and extensibility.