Simplification Ordering for Higher-Order Rewrite Systems
スポンサーリンク
概要
- 論文の詳細を見る
Simplification orderings, like the recursive path ordering and the improved recursive decomposition ordering, are widely used for proving the termination property of term rewriting systems. The recursive path ordering is known as the most useful simplification ordering. Recently Jouannaud and Rubio extended the recursive path ordering to higher-order rewrite systems by introducing an ordering on type structure. In this paper, we define the notion of simplification orderings for higher-order rewrite systems. Further, we redefine the recursive path ordering for higher-order rewrite systems and compare our approach to that of Jouannaud and Rubio.
- 一般社団法人情報処理学会の論文
- 1999-05-15
著者
-
TOYAMA Yoshihito
Faculty of Information Science, Japan Advanced Institute of Science and Technology
-
Iwami M
School Of Information Science Japan Advanced Institute Of Science And Technology Hokuriku
-
Iwami Munehiro
Faculty Of Information Science Japan Advanced Institute Of Science And Technology
-
Iwami Munehiro
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 Y
Tohoku Univ. Sendai‐shi Jpn
-
Toyama Yoshihito
School Of Information Science Jaist
関連論文
- An Improved Recursive Decomposition Ordering for Higher-Order Rewrite 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
- Persistence of Termination for Non-Overlapping Term Rewriting 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)