CONFLUENT TERM REWRITING-SYSTEMS WITH MEMBERSHIP CONDITIONS

被引:0
作者
TOYAMA, Y
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:228 / 241
页数:14
相关论文
共 10 条
[1]  
Barendregt H. P., 1981, LAMBDA CALCULUS ITS
[2]   CONDITIONAL REWRITE RULES - CONFLUENCE AND TERMINATION [J].
BERGSTRA, JA ;
KLOP, JW .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1986, 32 (03) :323-362
[4]  
HUET G, 1980, FORMAL LANGUAGE THEO, P349
[5]   COMPLETION OF A SET OF RULES MODULO A SET OF EQUATIONS [J].
JOUANNAUD, JP ;
KIRCHNER, H .
SIAM JOURNAL ON COMPUTING, 1986, 15 (04) :1155-1194
[6]   CONDITIONAL REWRITE RULES [J].
KAPLAN, S .
THEORETICAL COMPUTER SCIENCE, 1984, 33 (2-3) :175-193
[7]  
Klop J. W., 1980, THESIS U UTRECHT
[8]  
Knuth D., 1970, COMPUTATIONAL PROBLE, P263
[9]   TREE-MANIPULATING SYSTEMS AND CHURCH-ROSSER THEOREMS [J].
ROSEN, BK .
JOURNAL OF THE ACM, 1973, 20 (01) :160-187
[10]   ON THE CHURCH-ROSSER PROPERTY FOR THE DIRECT SUM OF TERM REWRITING-SYSTEMS [J].
TOYAMA, Y .
JOURNAL OF THE ACM, 1987, 34 (01) :128-143