A Typo in the Paterson-Wegman-de Champeaux algorithm
Logic in Computer Science
2020-07-02 v1
Abstract
We investigate the Paterson-Wegman-de Champeaux linear-time unification algorithm. We show that there is a small mistake in the de Champeaux presentation of the algorithm and we provide a fix.
Cite
@article{arxiv.2007.00304,
title = {A Typo in the Paterson-Wegman-de Champeaux algorithm},
author = {Valeriu Motroi and Stefan Ciobaca},
journal= {arXiv preprint arXiv:2007.00304},
year = {2020}
}
Comments
Unification Algorithm