Unification of Drags and Confluence of Drag Rewriting
Résumé
Drags are a recent, natural generalization of terms which admit arbitrary cycles. A key aspect of drags is that they can be equipped with a composition operator so that rewriting amounts to replace a drag by another in a composition. In this paper, we develop a unification algorithm for drags that allows to check the local confluence property of a set of drag rewrite rules.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|