Narrowing strategies for arbitrary canonical rewrite systems

Bockmayr, Alexander; Krischer, Stefan; Werner, Andreas

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

報告書

Narrowing strategies for arbitrary canonical rewrite systems

MPS-Authors

/persons/resource/persons44149

Bockmayr, Alexander
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

MPI-I-93-233.pdf
(全文テキスト（全般）), 195KB

付随資料 (公開)

There is no public supplementary material available

引用

Bockmayr, A., Krischer, S., & Werner, A.(1993). Narrowing strategies for arbitrary canonical rewrite systems (MPI-I-93-233). Saarbrücken: Max-Planck-Institut für Informatik.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-B487-7

要旨

Narrowing is a universal unification procedure for equational theories defined by a canonical term rewriting system. In its original form it is extremely inefficient. Therefore, many optimizations have been proposed during the last years. In this paper, we present the narrowing strategies for arbitrary canonical systems in a uniform framework and introduce the new narrowing strategy LSE narrowing. LSE narrowing is complete and improves all other strategies which are complete for arbitrary canonical systems. It is optimal in the sense that two different LSE narrowing derivations cannot generate the same narrowing substitution. Moreover, LSE narrowing computes only normalized narrowing substitutions.