Article

Free access

A relational language for parallel programming

Authors:

Keith L. Clark,

Steve GregoryAuthors Info & Claims

FPCA '81: Proceedings of the 1981 conference on Functional programming languages and computer architecture

Pages 171 - 178

https://doi.org/10.1145/800223.806776

Published: 18 October 1981 Publication History

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

[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]

Dijkstra E.W. {1976}, A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ.

Digital Library

[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]

Friedman D.P. and Wise D.S. {1980}, An indeterminate constructor for applicative programming. In Record 7th ACM Symp. on Principles of Programming Languages, 245-250.

Digital Library

[7]

Hoare C.A.R. {1978}, Communicating sequential processes. Comm. ACM 21, 8 (August 1978), 666-677.

Digital Library

[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]

Kowalski R.A. {1979}, Logic for Problem Solving. North Holland, New York.

Digital Library

[12]

MacQueen D.B. {1979}, Models for distributed computing. Rapport de Recherche 351, INRIA, France.

[13]

Milne G. and Milner R. {1979}, Concurrent processes and their syntax. J. ACM 26, 2 (April 1979), 302-321.

Digital Library

[14]

Robinson J.A. {1965}, A machine oriented logic based on the resolution principle. J. ACM 12, 1 (January 1965), 23-41.

Digital Library

[15]

Warren D.H.D. {1977}, Implementing Prolog - compiling predicate logic programs. Research reports 39, 40, Dept. of AI, Edinburgh Univ.

Cited By

Ozaki TGoebel RInoue K(2019)From Fifth Generation Computing to Skill ScienceNew Generation Computing10.1007/s00354-019-00058-yOnline publication date: 25-Apr-2019
https://doi.org/10.1007/s00354-019-00058-y
CALEGARI RDENTI EMARIANI SOMICINI A(2018)Logic programming as a serviceTheory and Practice of Logic Programming10.1017/S147106841800036418:5-6(846-873)Online publication date: 18-Jul-2018
https://doi.org/10.1017/S1471068418000364
Gregory SPaschali M(2007)A prolog-based language for workflow programmingProceedings of the 9th international conference on Coordination models and languages10.5555/1764606.1764612(56-75)Online publication date: 6-Jun-2007
https://dl.acm.org/doi/10.5555/1764606.1764612
Show More Cited By

Index Terms

A relational language for parallel programming

Recommendations

A dynamic logic programming language for relational updates
TABLOG: the deductive-tableau programming language
Programming Language Semantics with Isabelle/HOL
WEIT '13: Proceedings of the 2013 2nd Workshop-School on Theoretical Computer Science

Isabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order Logic. In programming language theory, formal semantics is the field concerned ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

FPCA '81: Proceedings of the 1981 conference on Functional programming languages and computer architecture

October 1981

228 pages

ISBN:0897910605

DOI:10.1145/800223

Chairmen:
Arvind,
Jack Dennis

Copyright © 1981 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPL: ACM Special Interest Group on APL Programming Language
MIT: Massachusetts Institute of Technology

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 October 1981

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

70
Total Citations
View Citations
328
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)11

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ozaki TGoebel RInoue K(2019)From Fifth Generation Computing to Skill ScienceNew Generation Computing10.1007/s00354-019-00058-yOnline publication date: 25-Apr-2019
https://doi.org/10.1007/s00354-019-00058-y
CALEGARI RDENTI EMARIANI SOMICINI A(2018)Logic programming as a serviceTheory and Practice of Logic Programming10.1017/S147106841800036418:5-6(846-873)Online publication date: 18-Jul-2018
https://doi.org/10.1017/S1471068418000364
Gregory SPaschali M(2007)A prolog-based language for workflow programmingProceedings of the 9th international conference on Coordination models and languages10.5555/1764606.1764612(56-75)Online publication date: 6-Jun-2007
https://dl.acm.org/doi/10.5555/1764606.1764612
Gregory SPaschali M(2007)A Prolog-Based Language for Workflow ProgrammingCoordination Models and Languages10.1007/978-3-540-72794-1_4(56-75)Online publication date: 2007
https://doi.org/10.1007/978-3-540-72794-1_4
Levi G(2005)Logic programming: The foundations, the approach and the role of concurrencyCurrent Trends in Concurrency10.1007/BFb0027045(396-441)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0027045
Ueda K(2005)I/O mode analysis in concurrent logic programmingTheory and Practice of Parallel Programming10.1007/BFb0026579(356-368)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0026579
Podelski ASmolka G(2005)Situated simplificationPrinciples and Practice of Constraint Programming — CP '9510.1007/3-540-60299-2_20(328-344)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60299-2_20
Foster IKesselman C(2005)Language constructs and runtime systems for compositional parallel programmingParallel Processing: CONPAR 94 — VAPP VI10.1007/3-540-58430-7_2(5-16)Online publication date: 3-Jun-2005
https://doi.org/10.1007/3-540-58430-7_2
Kurfeß F(2005)Potentiality of parallelism in logicParallelization in Inference Systems10.1007/3-540-55425-4_1(1-25)Online publication date: 28-May-2005
https://doi.org/10.1007/3-540-55425-4_1
Fuchi KFurukawa K(2005)Role of logic programming in the FGCS projectTheoretical Aspects of Computer Software10.1007/3-540-54415-1_52(311-325)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-54415-1_52
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents