%0 Journal Article
%T Nonterminating Rewritings with Head Boundedness
%A Chen Yiyun
%A <br>Chen
%A Yiyun
%J 计算机科学技术学报
%D 1993
%I 
%X We define here the concept of head boundedness,head normal form and head confluence of term rewriting systems that allow infinite derivations.Head confluence is weaker than confluence,but suffi- cient to guarantee the correctness of lazy implementations of equational logic programming languages. Then we prove several results.First,if a left-linear system is locally confluent and head-bounded,then it is head-confluent.Second,head-confluent and head-bounded systems have the head Church-Rosser proper- ty.Last,if an orthogonal system is head-terminating,then it is bead-bounded.These results can be ap- plied to generalize equational logic programming languages.
%K Term rewriting systems
%K confluence
%K termination<br>终端设备
%K 重写系统
%K 逻辑设计语言
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=7C869AB6997059CF104C82EB2E447A9A&yid=D418FDC97F7C2EBA&vid=5D311CA918CA9A03&iid=0B39A22176CE99FB&sid=5C3443B19473A746&eid=80A07035DF96B0C4&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=1&reference_num=1