Sciweavers

JSC
2008
72views more  JSC 2008»
13 years 4 months ago
Flat matching
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
Temur Kutsia
COOPIS
2004
IEEE
13 years 8 months ago
CLP(Flex): Constraint Logic Programming Applied to XML Processing
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 symb...
Jorge Coelho, Mário Florido