REWRITE, REWRITE, REWRITE, REWRITE, REWRITE, ...

被引：48
作者：
DERSHOWITZ, N
KAPLAN, S
PLAISTED, DA
机构：
[1] BAR ILAN UNIV, DEPT COMP SCI, IL-52100 RAMAT GAN, ISRAEL
[2] UNIV PARIS 11, RECH INFORMAT LAB, F-91405 ORSAY, FRANCE
[3] UNIV N CAROLINA, DEPT COMP SCI, CHAPEL HILL, NC 27599 USA
来源：
THEORETICAL COMPUTER SCIENCE | 1991年 / 83卷 / 01期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1016/0304-3975(91)90040-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories. We also consider sufficient completeness of hierarchical systems.
引用
收藏
页码：71 / 96
页数：26
相关论文
共 29 条
[1]  
CHEN Y, 1991, IN PRESS LECTURE NOT, P45
[2]   INFINITE TREES IN NORMAL FORM AND RECURSIVE EQUATIONS HAVING A UNIQUE SOLUTION [J].
COURCELLE, B .
MATHEMATICAL SYSTEMS THEORY, 1979, 13 (02) :131-180
[3]  
COURCELLE B, 1979, RAIRO-INF THEOR-TH C, V13, P31
[4]   TERMINATION OF REWRITING [J].
DERSHOWITZ, N .
JOURNAL OF SYMBOLIC COMPUTATION, 1987, 3 (1-2) :69-116
[5]  
DERSHOWITZ N, 1987, J SYMB COMPUT, V4, P409
[6]  
DERSHOWITZ N, 1989, LECT NOTES COMPUT SC, V372, P249
[7]  
Dershowitz Nachum., 1990, HDB THEORETICAL COMP, P243
[8]  
Dershowitz Nachum, 1989, PRINCIPLES PROGRAMMI, P250
[9]  
ERHIG H, 1988, LECTURE NOTES COMPUT, V332, P23
[10]  
FARMER WM, 1991, LECTURE NOTES COMPUT
123