ACM Home Page
Please provide us with feedback. Feedback
A relational language for parallel programming
Full text PdfPdf (708 KB)
Source Functional Programming Languages and Computer Architecture archive
Proceedings of the 1981 conference on Functional programming languages and computer architecture table of contents
Portsmouth, New Hampshire, United States
Pages: 171 - 178  
Year of Publication: 1981
ISBN:0-89791-060-5
Authors
Keith L. Clark  Department of Computing, Imperial College, London SW7 2BZ, England
Steve Gregory  Department of Computing, Imperial College, London SW7 2BZ, England
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGOPS: ACM Special Interest Group on Operating Systems
MIT : Massachusetts Institute of Technology
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 24,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800223.806776
What is a DOI?

ABSTRACT

A parallel program often defines a relation not a function. The program constrains the output to lie in some relation R to the input, but the particular output produced during a computation can depend on the time behaviour of component processes. This suggests the use of a relational language as an applicative language for parallel programming. The Horn clause subset of predicate logic is a relational language with an established procedural interpretation for non-deterministic sequential computations [Kowalski 1974]. In this paper we modify and extend that interpretation to define a special purpose parallel evaluator.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Clark K.L. {1979}, Predicate logic as a computational formalism. Draft monograph, Dept. of Computing, Imperial College, London.
 
2
Clark K.L., McCabe F.G. and Gregory S. {1981}, IC-Prolog reference manual. Research report, Dept. of Computing, Imperial College, London.
 
3
Dausmann M., Persch G. and Winterstein G. {1979}, Concurrent logic. In Proc. 4th Workshop on AI, Bad Honnef.
 
4
 
5
van Emden M.H., de Lucena G.J. and Silva H. de M. {1981}, Predicate logic as a language for parallel programming. Research report, Dept. of Computer Science, Univ. of Waterloo, Ontario.
6
7
 
8
Hogger C.J. {1980}, Logic representation of a concurrent algorithm. Research report, Dept. of Civil Engineering, Imperial College, London.
 
9
Kahn G. and MacQueen D.B. {1977}, Coroutines and networks of parallel processes. In Proc. IFIP Congress 77, North Holland, Amsterdam, 993-998.
 
10
Kowalski R.A. {1974}, Predicate logic as programming language. In Proc. IFIP Congress 74, North Holland, Amsterdam, 569-574.
 
11
 
12
MacQueen D.B. {1979}, Models for distributed computing. Rapport de Recherche 351, INRIA, France.
13
14
 
15
Warren D.H.D. {1977}, Implementing Prolog - compiling predicate logic programs. Research reports 39, 40, Dept. of AI, Edinburgh Univ.

CITED BY  21

Collaborative Colleagues:
Keith L. Clark: colleagues
Steve Gregory: colleagues