CFLP: a Distributed Constraint Solving System for Functional Logic Programming

In this paper we present the distributed software system CFLP for solving constraints over the complex numbers in a functional logic programming environment. We describe the general architecture of the system and the functionality of its main components. 1 Introduction Functional and logic programming are the most important declarative programming paradigms and interest in combining them has grown over the last decade (see [7] for a survey). A sound and complete method to solve equations with respect to a terminating and confluent term rewriting systems is narrowing [9]. There are many variants of narrowing that can be successfully used as an implementation basis of a functional logic programming (FLP) language. Among them, the lazy narrowing calculi (LNC) developed by Symbolic Computation REsearch group (SCORE) at the University of Tsukuba were successfully implemented in the Mathematica system [5]. In particular, the calculi LCNC [6] and Higher-Order LNC [14] attract interest becau..