Abstract. In this paper we present an implementation of a constraint solving module, CLP(Flex), for dealing with unification in an equality theory for terms with flexible arity function symbols. Then we present an application of CLP(Flex) to XML-processing where XML documents are abstracted by terms with flexible arity symbols. This gives a highly declarative model for XML processing yielding a substantial degree of flexibility in programming.
REF developed a constraint logic programming language CLP(Flex) over the domain of terms with sequence variables and flexible arity symbols.
CLP(Flex): Constraint logic programming applied to XML processing
On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. Proc. of Confederated Int. Conferences, volume 3291 of LNCS
Computer Science