๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Continuation compilation for concurrent logic programming

โœ Scribed by B Kemp; P Soper; A King

Publisher
Elsevier Science
Year
1994
Weight
913 KB
Volume
19
Category
Article
ISSN
0066-4138

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Compiling associativity into logic progr
Compiling associativity into logic programs
โœ D.R. Brough; C.J. Hogger ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1013 KB

We show how a simple but important class of recursive logic programs can be mechanically transformed to take advantage of the associativity of auxiliary relations. This often results in improved efficiency through the introduction of tail recursion. We give proofs of correctness both for the transfo

Constraint Satisfaction in Distributed C
Constraint Satisfaction in Distributed Concurrent Logic Programming
โœ HO-FUNG LEUNG; KEITH L. CLARK ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 602 KB

In constraint logic programming, unification is replaced by more general constraint satisfaction. To support constraint solving in a committed-choice concurrent logic programming language, the constraint solver also needs to determine the status of the 'ask'-constraints with respect to the current c