Premium
Declarative solutions to partitioned‐grid problems
Author(s) -
Etalle Sandro,
Hartel Pieter H.,
Vree Willem G.
Publication year - 1999
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(199911)29:13<1173::aid-spe276>3.0.co;2-x
Subject(s) - logic programming , prolog , computer science , correctness , backtracking , programming language , grid , theoretical computer science , declarative programming , functional programming , programming paradigm , mathematics , inductive programming , geometry
The problem of partitioning grid‐based applications for parallel computing can be solved easily and intuitively in a logic programming language such as Prolog, using only the single assignment property of the logic variable, and not the backtracking. We show that such a logic program can be transformed in a systematic way into a circular functional program, which runs 10 times faster than the original logic program. The transformation proceeds in a number of steps. The first step is novel, and we give a correctness proof. Our reasoning also uses a novel combination of concepts from both the logical and functional paradigms. Copyright © 1999 John Wiley & Sons, Ltd.