Parlog86 and the dining logicians
Communications of the ACMPublished 1 January 1988Open access
G. A. Ringwood
Citations52
SJR quartileQ1
SJR score1.15
SNIP3.34
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A growing number of logic programming languages have been refined to handle concurrent programming, one in particular is Parlog86, which challenges the power of any aspiring concurrent program language.
Abstract
A classic problem in concurrent programming is that of the "dining philosophers" which challenges the power of any aspiring concurrent program language. Recently, a growing number of logic programming languages have been refined to handle concurrent programming, one in particular is Parlog86.
Keywords
Computer Science
IFIP CongressThe Semantics of a Simple Language for Parallel Programming.
2,116 Citations1974Gilles Kahn
A simple language for parallel programming is described and its mathematical properties are studied to make a case for more formal languages for systems programming and the design of operating systems.
Communications of the ACMGuarded commands, nondeterminacy and formal derivation of programs
1,926 Citations1975Edsger W. Dijkstra
So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state.
Acta InformaticaHierarchical ordering of sequential processes
770 Citations1971E. Dijkstra
A “director-secretary” relationship will be introduced to reflect a possible discipline in the use of sequencing primitives and an analysis of the requirements of the correctness proofs will give an insight into the logical issues at hand.
Lecture notes in computer scienceGuarded horn clauses
332 Citations1986Kazunori Ueda
A set of Horn clauses, augmented with a ‘guard’ mechanism, is shown to be a simple and yet powerful parallel logic programming language.
ACM Transactions on Programming Languages and SystemsPARLOG: parallel programming in logic
327 Citations1986Keith Clark, Steven Gregory
A tutorial introduction to PARLOG, a logic programming language in the sense that nearly every definition and query can be read as a sentence of predicate logic, which differs from PROLOG in incorporating parallel modes of evaluation.
Communications of the ACMA view of the origins and development of Prolog
58 Citations1988Jacques Cohen
Dealing with failure is easy: Work hard to improve; success is easy to handle: You've solved the wrong problem.
The Journal of Logic ProgrammingNotes on the implementation of PARLOG
38 Citations1985Keith Clark, Steven Gregory
The paper presents a step-by-step reduction of PARLOG to Kernel PARLOG, which defines the set and subset primitives by interpreters in the single-solution subset of PAR LOG.
The concurrent logic programming language CP: Definition and operational semantics
37 Citations1987Vijay Saraswat
This paper presents a formal structural operational semantics and relate the meaning of programs in this language to the underlying (pure) Horn clause axioms.
Philosophical Transactions of the Royal Society of London Series A Mathematical and Physical SciencesThe relation between logic programming and logic specification
32 Citations1984Robert Kowalski
This paper shall investigate the relation that holds when both programs and program specifications are expressed in formal logic, when all relations defined by complete specifications are executable.
FigshareProblems with concurrent prolog
21 Citations2018Vijay Saraswat
It is argued that pure Horn logic does not provide the correct conceptual framework for concurrent programming, and C o n c u r r r e n t P r o l o g is best thought of as a set of control features designed to select some of the many possible execution paths in an inherently non-deterministic language.
An indeterminate constructor for applicative programming
20 Citations1980Daniel P. Friedman, David S. Wise
The encapsulization and control of contending parallel processes within data structures is proposed, which means that an indeterminate behavior, never precisely specified by the programmer or by the input, may be shared in the same way that an argument to a function is shared by every use of the corresponding parameter.