Bounded quantifications for iteration and concurrency in logic programming |
| |
Authors: | Jonas Barklund |
| |
Affiliation: | 1. Computing Science Department, Uppsala University, Uppsala, Sweden
|
| |
Abstract: | The only means for repetition in most logic programming languages, including Prolog, is recursion. Definite iteration is introduced in logic programming languages through the bounded quantification construct. Firstly, it is claimed that this construct is often, though not always, more natural than recursion for expressing relations that involve repetition. In particular, programs involving arrays and similar data structures are significantly simplified. Secondly, it is argued that bounded quantifications should be efficiently implementable on sequential computers and have a high potential for running in parallel, particularly on computers supporting the SPMD model of computation. Bounded quantifications are compared with related constructs from other languages, including the definite loops of imperative languages and the array comprehensions of recent functional languages. |
| |
Keywords: | Parallel Computation Definite Interation Arrays Data Parallelism Quantifiers |
本文献已被 SpringerLink 等数据库收录! |
|