Describes the current status of the development of CFLP (constraint functional logic programming), a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS) and distributed constraint solving. FLP provides support for defining one's own abstractions (user-defined functions and predicates) over a constraint domain in an easy and comfortable way, whereas CCS is employed to solve systems of mixed constraints by iterating specialized constraint-solving methods in accordance with a well-defined strategy. CFLP is a distributed implementation of a cooperative FLP scheme obtained from the integration of higher-order lazy narrowing for FLP with CCS. The implementation takes advantage of the existence of several constraint-solving resources located in a distributed environment, which communicate asynchronously via message passing.
[1]
Stephen Wolfram,et al.
The Mathematica Book
,
1996
.
[2]
Aart Middeldorp,et al.
A Deterministic Lazy Narrowing Calculus
,
1998,
J. Symb. Comput..
[3]
Gérard P. Huet,et al.
A Unification Algorithm for Typed lambda-Calculus
,
1975,
Theor. Comput. Sci..
[4]
Taro Suzuki,et al.
On Reducing the Search Space of Higher-Order Lazy Narrowing
,
1999,
Fuji International Symposium on Functional and Logic Programming.
[5]
Tetsuo Ida,et al.
Lazy Narrowing: Strong Completeness and Eager Variable Elimination
,
1996,
Theor. Comput. Sci..