Art

J-GLOBAL ID：200902165142000149   Reference number：99A0538539

Simplification Ordering for Higher-Order Rewrite Systems.

高階書換え系のための単純化順序

Author (2)： IWAMI M (Japan Advanced Inst. Sci. and Technol., Hokuriku) ,  TOYAMA Y (Japan Advanced Inst. Sci. and Technol., Hokuriku)
Material： 情報処理学会論文誌  (IPSJ Journal)
Volume： 40  Issue： SIG4(PRO3)  Page： 1-10  Publication year： May. 15, 1999 
JST Material Number： Z0778A  ISSN： 0387-5806  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *term rewriting system ,...
Semi thesaurus term： 停止性【ソフトウェア】

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

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

Reference (12)：

• BAADER, F. Term rewriting and all that. 1998
• DERSHOWITZ, N. Orderings for term-rewriting systems. Theoretical Computer Science. 1982, 17, 279-301
• DERSHOWITZ, N. Termination of rewriting. J. Symbolic Computation. 1987, 3, 69-116
• IWAMI, M. An improved recursive decomposition ordering for higher-order rewrite systems. IEICE Transactions of Information and Systems. 1998, E81-D, 988-996
• JOUANNAUD, J. P. A recursive path ordering for higher-order terms in η-long β-normal form. LNCS. 1996, 1103, 108-122

Terms in the title (3)： 書換え系 ,  単純化 ,  順序