Name
Abstract | ||
|---|---|---|
. An extension of a modular termination result for term rewritingsystems (TRSs, for short) by A. Middeldorp (1989) is presented. Weintended to obtain this by adapting the dummy elimination transformationby M. C. F. Ferreira and H. Zantema (1995) under the presence of anon-collapsing non-duplicating terminating TRS whose function symbolsare all to be eliminated. We propose a tree lifting ordering induced froma reduction order and a set G of function symbols, and use this orderingto... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0052375 | RTA |
Keywords | Field | DocType |
tree lifting ordering,termination transformation | Discrete mathematics,Symbol,Algorithm,Normalization property,Rewriting,Modular programming,Modular design,Mathematics,Equational theory | Conference |
Volume | ISSN | ISBN |
1379 | 0302-9743 | 3-540-64301-X |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takahito Aoto | 1 | 121 | 17.53 |
| Yoshihito Toyama | 2 | 533 | 49.60 |