A folding algorithm for eliminating existential variables from constraint logic programs

The existential variables of a clause in a constraint logic program are the variables which occur in the body of the clause and not in its head. The elimination of these variables is a transformation technique which is often used for improving program efficiency and verifying program properties. We, consider a folding transformation rifle which ensures the elimination of existential variables and we propose an algorithm for applying this rule in the case where the constraints are linear inequations over rational or real numbers. The algorithm combines techniques for matching, terms modulo equational theories and for solving systems of linear inequations. We show that an implementation of our folding algorithm performs well in practice