A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
2008
ACM Transactions on Computational Logic
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 [20] 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.
doi:10.1145/1352582.1352583
fatcat:c6q6kwtwcreunfpuhphcfcrlky