The Weighted Path Order for Termination of Term Rewriting
名古屋大学博士学位論文 学位の種類:博士(情報科学) 学位授与年月日:2014-09-29
Main Authors: | 山田, 晃久, Yamada, Akihisa |
---|---|
Language: | en |
Published: |
2014
|
Online Access: | http://hdl.handle.net/2237/20647 |
Similar Items
-
Termination and applications of term rewriting systems
by: Mohamed, Hanan A.
Published: (1989) -
Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems
by: UCHIYAMA, Keita, et al.
Published: (2007) -
On Proving Termination of Higher-Order Rewrite Systems by Dependency Pair Technique
by: Sakai, Masahiko, et al.
Published: (2002) -
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
by: SAKAI, Masahiko, et al.
Published: (2005) -
Dynamic order-sorted term-rewriting systems
by: Matthews, Brian Martin
Published: (1996)