A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This work presents a general methodology for verification of the completeness of firstorder unification algorithmsà la Robinson developed in the higher-order proof assistant PVS. The methodology is based on a previously developed formalization of the theorem of existence of most general unifiers for unifiable terms over first-order signatures. Termination and soundness proofs of any unification algorithm are proved by reusing the formalization of this theorem and completeness should be proveddoi:10.1007/978-3-642-13824-9_10 fatcat:ne54gywxnre4jpqld5mosc5fkm