A Typo in the Paterson-Wegman-de Champeaux algorithm

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.