| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
rifis-tr-2