<テクニカルレポート>
Completeness of Extended Unification Based on Basic Narrowing

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 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.続きを見る

本文情報を非表示

rifis-tr-2 pdf 977 KB 70  

詳細

レコードID
査読有無
関連情報
注記
タイプ
登録日 2009.04.22
更新日 2017.01.20