Computer Science – Programming Languages
Scientific paper
2003-09-24
Computer Science
Programming Languages
27 pages, 11 figures
Scientific paper
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from an axiomatic point of view with a parametric approach in (*) where the relevant unification algorithms have been developed. In this paper we extend these results considering more general constraints including not only equality but also membership constraints as well as their negative counterparts. (*) A. Dovier, A. Policriti, and G. Rossi. A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms. Fundamenta Informaticae, 36(2/3):201--234, 1998.
Dovier Agostino
Piazza Carla
Rossi Gianfranco
No associations
LandOfFree
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A uniform approach to constraint-solving for lists, multisets, compact lists, and sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A uniform approach to constraint-solving for lists, multisets, compact lists, and sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-509799