DocumentCode :
2851475
Title :
A New Order Which Proved the Termination of Term Rewriting System
Author :
Chen Chen ; Chen, Chen
Author_Institution :
Inf. Eng. Univ., Zhengzhou, China
fYear :
2009
fDate :
19-20 Dec. 2009
Firstpage :
1
Lastpage :
4
Abstract :
Term rewriting is a branch of theoretical computer science which combines elements of logic, universal algebra, automated theorem proving and functional programming, it has lots of application in math and computer field. Termination is a very important property of term rewriting system, and the standard detected measure is constructing a reduction order, but a right order is difficult to construct. A new reduction order which called vector order is given, it has obvious advantage in realization and complexity compared with some mostly existent reduction order which as polynomial order and lexicographic path order.
Keywords :
rewriting systems; lexicographic path order; polynomial order; reduction order; term rewriting system; termination; theoretical computer science; vector order; Algebra; Application software; Computer science; Equations; Functional programming; Logic functions; Logic programming; Measurement standards; Polynomials; Reactive power;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4994-1
Type :
conf
DOI :
10.1109/ICIECS.2009.5365416
Filename :
5365416
Link To Document :
بازگشت