A relational language for parallel programming
作者： Keith L. Clark , Steve Gregory
关键词: Horn clause 、 Parallel programming model 、 Interpretation (logic) 、 Predicate logic 、 SQL 、 Theoretical computer science 、 Relation (database) 、 First-generation programming language 、 Programming language 、 Computer science 、 Programming domain
摘要: A parallel program often defines a relation not function. The constrains the output to lie in some R input, but particular produced during computation can depend on time behaviour of component processes. This suggests use relational language as an applicative for programming.The Horn clause subset predicate logic is with established procedural interpretation non-deterministic sequential computations [Kowalski 1974]. In this paper we modify and extend that define special purpose evaluator.
acm.org
core.ac.uk 
sci-hub.se 参考文章(6)
Gilles Kahn, David B. MacQueen, Coroutines and Networks of Parallel Processes ifip congress. pp. 20- ,(1976)
Robert A. Kowalski, Predicate Logic as Programming Language. ifip congress. pp. 569- 574 ,(1974)
George Milne, Robin Milner, Concurrent Processes and Their Syntax Journal of the ACM. ,vol. 26, pp. 302- 321 ,(1979) , 10.1145/322123.322134
Daniel P. Friedman, David S. Wise, An indeterminate constructor for applicative programming symposium on principles of programming languages. pp. 245- 250 ,(1980) , 10.1145/567446.567470
J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle Journal of the ACM. ,vol. 12, pp. 23- 41 ,(1965) , 10.1145/321250.321253
Tony Hoare, Communicating Sequential Processes ,(1985)