A Typo in the Paterson-Wegman-de Champeaux algorithm
Valeriu Motroi, Stefan Ciobaca
TL;DR
This paper identifies and corrects a small mistake in the de Champeaux presentation of the Paterson-Wegman linear-time unification algorithm, ensuring its correctness.
Contribution
It provides a correction to the previously published description of the Paterson-Wegman-de Champeaux algorithm.
Findings
The original presentation contained a small mistake.
A corrected version of the algorithm is provided.
The correction ensures the algorithm's correctness.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Logic, programming, and type systems · Advanced Numerical Analysis Techniques