Art

J-GLOBAL ID：200902237653363585   Reference number：03A0223066

Proving Termination of Simply Typed Term Rewriting Systems Automatically.

単純型付き項書換え系における停止性の自動証明

Author (2)： AOTO TAKAHITO (群馬大 工) ,  YAMADA TOSHIYUKI (三重大 工)
Material： 情報処理学会論文誌  (IPSJ Journal)
Volume： 44  Issue： SIG4(PRO17)  Page： 67-77  Publication year： Mar. 15, 2003 
JST Material Number： Z0778A  ISSN： 0387-5806  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： *term rewriting system ,...
Semi thesaurus term： terminating ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=03A0223066&from=J-GLOBAL&jstjournalNo=Z0778A") }}

JST classification (1)： Theory of computation  (JB02000A)

Reference (15)：

• ARTS, T. Termination of Term Rewriting Using Dependency Paris. Theoretical Computer Science. 2000, 236, 133-178
• BAADER, F. Term Rewriting and All That. 1998
• DERSHOWITZ, N. Orderings for Term-Rewriting Systems. Theoretical Computer Science. 1982, 17, 279-301
• DERSHOWITZ, N. Rewrite Systems. Handbook of Theoretical Computer Science, B. 1990, 243-320
• JOUANNAUD, J. -P. Executable Higher-Order Algebraic Specification Languages. Proc. 6th IEEE Symposium on Logic in Computer Science (LICS'91). 1991, 350-361

Terms in the title (3)： 項書換え系 ,  停止性 ,  証明