Properties of substitutions and unifications
- 31 March 1985
- journal article
- Published by Elsevier BV in Journal of Symbolic Computation
- Vol. 1 (1), 31-46
- https://doi.org/10.1016/s0747-7171(85)80027-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Complete sets of unifiers and matchers in equational theoriesLecture Notes in Computer Science, 1983
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Linear unificationJournal of Computer and System Sciences, 1978
- The Concept of Weak Substitution in Theorem-ProvingJournal of the ACM, 1973
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965