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 article, we extend these results considering more general constraints, namely, equality and membership constraints and their negative counterparts. © 2008 ACM.
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
DOVIER, Agostino;PIAZZA, Carla;
2008-01-01
Abstract
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 article, we extend these results considering more general constraints, namely, equality and membership constraints and their negative counterparts. © 2008 ACM.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
0309045.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
420.79 kB
Formato
Adobe PDF
|
420.79 kB | Adobe PDF | Visualizza/Apri |
|
a15-dovier.pdf
non disponibili
Descrizione: Editorial version
Tipologia:
Versione Editoriale (PDF)
Licenza:
Non pubblico
Dimensione
367.63 kB
Formato
Adobe PDF
|
367.63 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
