A uniform approach to constraint-solving for lists, multisets, compact lists, and sets

Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. They have been analyzed from an axiomatic point of view with a parametric approach in [Dovier et al. 1998] where the relevant unification algorithms have been developed. In this paper we extend these results considering more general constraints, namely equality and membership constraints and their negative counterparts