ON EQUIVALENCE TRANSFORMATIONS FOR TERM REWRITING-SYSTEMS

被引：0
作者：
TOYAMA, Y
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 220卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：44 / 61
页数：18
相关论文
共 50 条
[21]   SPECIFICATION OF REDUCTION STRATEGIES IN TERM REWRITING-SYSTEMS [J].
VANEEKELEN, MCJD ;
PLASMEIJER, MJ .
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 279 :215-239
[22]   DATAFLOW ANALYSIS OF TERM GRAPH REWRITING-SYSTEMS [J].
BANACH, R .
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 366 :55-72
[23]   DECOMPOSABLE TERMINATION OF COMPOSABLE TERM REWRITING-SYSTEMS [J].
KURIHARA, M ;
OHUCHI, A .
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (04) :314-320
[24]   STATIC ANALYSIS OF TERM GRAPH REWRITING-SYSTEMS [J].
HANKIN, C .
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 506 :367-384
[25]   SUFFICIENT COMPLETENESS, TERM REWRITING-SYSTEMS AND ANTIUNIFICATION [J].
COMON, H .
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 :128-140
[26]   CONFLUENT TERM REWRITING-SYSTEMS WITH MEMBERSHIP CONDITIONS [J].
TOYAMA, Y .
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 308 :228-241
[27]   MODULAR PROPERTIES OF CONDITIONAL TERM REWRITING-SYSTEMS [J].
MIDDELDORP, A .
INFORMATION AND COMPUTATION, 1993, 104 (01) :110-158
[28]   DECIDABILITY OF CONFLUENCE FOR GROUND TERM REWRITING-SYSTEMS [J].
DAUCHET, M ;
TISON, S .
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 :80-89
[29]   TRANSFINITE REDUCTIONS IN ORTHOGONAL TERM REWRITING-SYSTEMS [J].
KENNAWAY, R ;
KLOP, JW ;
SLEEP, R ;
DEVRIES, FJ .
INFORMATION AND COMPUTATION, 1995, 119 (01) :18-38
[30]   COMPILATION OF GROUND TERM REWRITING-SYSTEMS AND APPLICATIONS [J].
DAUCHET, M ;
DERUYVER, A .
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 :556-558
12345