concept
active
concept:parlog86Parlog86
Concurrent logic language; Linda authors demonstrate simpler solutions to client-server and dining philosophers problems.
Neighborhood — ranked by edge-count
Papers (1)
paper
- Linda in contextcites
Thinkers (1)
thinker
- G. A. RingwoodintroducesAuthor of the Parlog86 article in Communications of the ACM used as the main comparison point for concurrent logic programming.
Frameworks (1)
framework
- Concurrent Logic ProgrammingextendsA parallel programming approach using guarded clauses and shared logical variables, exemplified by Parlog and Concurrent Prolog.
Communities (1)
community
- Programming Systemsmembers_of
Claims (2)
claim
- The central thesis of the paper, stated explicitly in the introduction.
- Parlog's merge process for client-server is unnecessarily complex; Linda's tuple operations remain flexible across problem variants.
Concepts (3)
concept
- Lindaassociated_withThe core parallel programming model introduced in this paper, based on tuple space operations and orthogonal to any base language.
- Dining Philosophers Problemassociated_withA classic concurrency benchmark problem used to test expressivity of parallel programming primitives; second main example for Parlog-Linda comparison.
- Client-Server Paradigmassociated_withA communication pattern where multiple client processes communicate with a single server; one of two main examples used to compare Parlog and Linda.
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.
- A concurrent logic language featured prominently in recent ACM literature; used as a primary comparison point for Linda.
- An early concurrent logic programming language.
- In Parlog86, client messages must be ordered; there is no way to build an unordered stream.claim0.716Criticism that Parlog forces ordered communication where unordered is sufficient, adding complexity.
- Pointing out that Parlog requires explicit, stream-count-dependent merging code.
- C-Linda code is easier to understand than the Parlog86 version [for the client-server problem].claim0.710Subjective but argued comparison.
- Pure functional programming language used as implementation substrate for Fruit; enables embedding of formal GUI model.
- Murray Shanahan's part-time employer and provider of LLM technology.