A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
(Nominal) Unification by Recursive Descent with Triangular Substitutions
[chapter]
2010
Lecture Notes in Computer Science
We mechanise termination and correctness for two unification algorithms, written in a recursive descent style. One computes unifiers for first order terms, the other for nominal terms (terms including α-equivalent binding structure). Both algorithms work with triangular substitutions in accumulator-passing style: taking a substitution as input, and returning an extension of that substitution on success. This style of algorithm has performance benefits and has not been mechanised previously. The
doi:10.1007/978-3-642-14052-5_6
fatcat:dnc4a3cjcrhp3bjxxptdsfazte