Rational Unification in 28 Characters

https://doi.org/10.1016/j.entcs.2005.02.013Get rights and content
Under a Creative Commons license
open access

Abstract

We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is efficient, that is quasi-linear, and simple: a program of 28 characters.

Keywords

synchronising graphs
synchronized hyperedge replacement
graph rewriting
unification
rational equations
regular trees
coalgebra

Cited by (0)