Decidability for left-linear growing term rewriting systems
スポンサーリンク
概要
- 論文の詳細を見る
- 北陸先端科学技術大学院大学の論文
- 1998-12-08
著者
-
Nagaya Takashi
School Of Information Science Japan Advanced Institute Of Science And Technology Hokuriku
-
Toyama Yoshihito
School of Information Science, Japan Advanced Institute of Science and Technology, Hokuriku
-
Toyama Yoshihito
School Of Information Science Jaist
関連論文
- An Improved Recursive Decomposition Ordering for Higher-Order Rewrite Systems
- Decidable/undecidable properties of conditional term rewriting systems
- On proving AC-termination by argument filtering method
- On proving Ac-termination by AC-dependency pairs
- Argument filtering transformation
- On Proving AC-Termination by Argument Filtering Method
- The hierarchy of dependency pairs
- Decidability for left-linear growing term rewriting systems
- Simplification ordering for higher-order rewrite systems
- Simplification Ordering for Higher-Order Rewrite Systems
- Index Reduction of Overlapping Strongly Sequential Systems
- NVNF-sequentiality of Left-linear Term Rewriting Systems(Theory of Rewriting Systems and Its Applications)
- Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems(Theory of Rewriting Systems and Its Applications)