Unification of drags and confluence of drag rewriting

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 a...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 131; p. 100845
Main Authors Jouannaud, Jean-Pierre, Orejas, Fernando
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.02.2023
Elsevier
Subjects
Computation and Language
Computer Science
Confluence
Drags
Graphs
Logic in Computer Science
Unification
Graphs
Drags
Confluence
Unification
graphs
confluence
unification
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2022.100845