Art
J-GLOBAL ID：200902106271740187
Reference number：98A0877080
An Improved Recursive Decomposition Ordering for Higher-Order Rewrite Systems.
高次書換え系のための改善された繰り返し分解順序づけ
-
Publisher site
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=98A0877080©=1") }}
-
Access JDreamⅢ for advanced search and analysis.
{{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=98A0877080&from=J-GLOBAL&jstjournalNo=L1371A") }}
Author (3)：
,
,
Material：
Volume：
E81-D
Issue：
9
Page：
988-996
Publication year：
Sep. 1998
JST Material Number：
L1371A
ISSN：
0916-8532
Document type：
Article
Article type：
原著論文
Country of issue：
Japan (JPN)
Language：
ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
JST classification (1)：
JST classification
Category name(code) classified by JST.
Theory of computation
Reference (17)：
-
DERSHOWITZ, N. Orderings for term-rewriting systems. Theoretical Computer Science. 1982, 17, 279-301
-
DERSHOWITZ, N. Proving temination with multiset orderings. Commun. ACM. 1979, 22, 8, 465-476
-
DERSHOWITZ, N. Rewrite systems. Handbook of Theretical Computer Science. 1990, B, 243-329
-
DERSHOWITZ, N. Temination of rewriting. J. Symbolic Computation. 1987, 3, 69-116
-
IWAMI, M. Termination of higher-order rewrite systems. IEICE Technical Report. 1996, COMP95-85
ｍore...
Terms in the title (3)：
Terms in the title
Keywords automatically extracted from the title.
,
,
Return to Previous Page
