Creator |
|
Language |
|
Publisher |
|
|
Date |
|
Source Title |
|
Vol |
|
Publication Type |
|
Access Rights |
|
Related DOI |
|
|
Related URI |
|
|
Relation |
|
|
Abstract |
In this paper we prove the completeness of unification based on the basic narrowing. first we prove the completeness of unification based on original narrowing under a weaker condition than the previo...us proof. Then we discuss the relation between basic narrowing and innermost reduction as the lifting lemma, and prove the completeness of unification based on the basic narrowing. Moreover, we give the switching lemma to combine the previous algorithm and our new proof.show more
|