日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

会議論文

LSE Narrowing for Decreasing Conditional Term Rewrite Systems

MPS-Authors
/persons/resource/persons44149

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

External Resource

https://rdcu.be/dxDqG
(出版社版)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

Bockmayr, A., & Werner, A. (1994). LSE Narrowing for Decreasing Conditional Term Rewrite Systems. In N., Dershowitz, & N., Lindenstrauss (Eds.), Conditional Term Rewriting Systems (pp. 51-70). Berlin, Germany: Springer.


引用: https://hdl.handle.net/11858/00-001M-0000-0014-AD0A-7
要旨
In an earlier paper, we introduced LSE narrowing, which is an optimal narrowing strategy for arbitrary canonical term rewrite systems without additional properties such as orthogonality or constructor discipline. In this paper, we extend LSE narrowing to confluent and decreasing conditional term rewrite systems.