Art
J-GLOBAL ID:200902146170527344   Reference number:99A0225532

Unreachability Proofs for β Rewriting Systems by Homomorphisms.

準同型写像によるβ書換え系の到達不能性証明
Author (3):
Material:
Volume: E82-D  Issue:Page: 339-347  Publication year: Feb. 1999 
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.
,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=99A0225532&from=J-GLOBAL&jstjournalNo=L1371A") }}
JST classification (1):
JST classification
Category name(code) classified by JST.
Theory of computation 
Reference (18):
  • AKAMA, K. Common Structure of Semi-Thue Systems, Petri Nets, and Other Rewriting Systems. Hokkaido University Information Engineering Technical Report, HIER-LI-9407. 1994
  • AKAMA, K. An Axiomatization of a Class of Rewriting Systems. Hokkaido University Information Engineering Technical Report. 1994
  • BOOK, R. Thue systems as rewriting systems. J. Symbolic Computation. 1987, 3, 39-68
  • BUCHBERGER, B. History and basic features of the criticalpair/completion procedure. J. Symbolic Computation. 1987, 3, 3-38
  • COUSOT, P. Abstract Interpretation and Application to Logic Programs. J. Logic Programming. 1992, 3, 2&3, 103-179
more...
Terms in the title (3):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page