The Qu-Prolog unification algorithm: formalisation and correctness
- 30 November 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 169 (1) , 81-112
- https://doi.org/10.1016/s0304-3975(96)00115-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Substitution revisitedTheoretical Computer Science, 1988
- A unification algorithm for typed
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972