Rational Unification in 28 Characters


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.

DOI: 10.1016/j.entcs.2005.02.013

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Cenciarelli2005RationalUI, title={Rational Unification in 28 Characters}, author={Pietro Cenciarelli and Alessandro Tiberi}, journal={Electr. Notes Theor. Comput. Sci.}, year={2005}, volume={127}, pages={3-20} }