Unification of drags and confluence of drag rewriting

Other authors

Universitat Politècnica de Catalunya. Departament de Ciències de la Computació

Universitat Politècnica de Catalunya. ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals

Publication date

2023-02

Abstract

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.


This work is partially supported by MCIN/AEI /10.13039/501100011033 under grant PID2020-112581GB-C21.


Peer Reviewed


Postprint (published version)

Document Type

Article

Language

English

Publisher

Elsevier

Related items

https://www.sciencedirect.com/science/article/pii/S2352220822000980

info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-112581GB-C21/ES/MODELOS Y TECNICAS PARA EL PROCESAMIENTO DE INFORMACION A GRAN ESCALA -- BARCELONA/

Recommended citation

This citation was generated automatically.

Rights

http://creativecommons.org/licenses/by/4.0/

Open Access

Attribution 4.0 International

This item appears in the following Collection(s)

E-prints [72987]