Programming in concurrent logic languages
The authors survey concurrent logic languages, which expand Prolog by dropping its built-in sequential search order. These languages make parallelism easy by avoiding the low-level constructs that result from a too direct translation of machine hardware into programmer's language.< >
Saved in:
| Published in: | IEEE software Vol. 12; no. 6; pp. 71 - 82 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Los Alamitos
IEEE
01.11.1995
IEEE Computer Society |
| Subjects: | |
| ISSN: | 0740-7459, 1937-4194 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The authors survey concurrent logic languages, which expand Prolog by dropping its built-in sequential search order. These languages make parallelism easy by avoiding the low-level constructs that result from a too direct translation of machine hardware into programmer's language.< > |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0740-7459 1937-4194 |
| DOI: | 10.1109/52.469762 |