A lingua franca for concurrent logic programming

Two of the more important concurrent logic programming languages with nonflat guards are GHC and Parlog. They balance the requirements of having clean semantics and providing good control facilities rather differently, and their respective merits are compared and contrasted. Since concurrent logic p...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering Vol. 18; no. 3; pp. 225 - 236
Main Author: Taylor, H.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.03.1992
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Subjects:
Applied sciences
Bismuth
Computer programming
Computer science
Computer science; control theory; systems
Connectivity
Exact sciences and technology
Logic programming
Multitasking
Parallel processing
Parallel programming
Programming languages
Semantics
Software
Systems design
Variables
Transparency
Programming language
Concurrent program
Semantics
Logical programming
PROLOG
Computer system
Implementation
ISSN:0098-5589, 1939-3520
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two of the more important concurrent logic programming languages with nonflat guards are GHC and Parlog. They balance the requirements of having clean semantics and providing good control facilities rather differently, and their respective merits are compared and contrasted. Since concurrent logic programming would benefit from both, but neither language is able to express all the programs expressible in the other language, a lingua franca of these languages is defined and justified. A method is given for translating GHC and Parlog to and from it. The method preserves the arities and execution conditions of each clause. It enables a lingua franca implementation to support both languages transparently, and to provide a simple concurrent logic programming language suitable for programming in its own right.< >
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/32.126771