@article{oai:nagoya.repo.nii.ac.jp:00007557,
 author = {Sakai, Masahiko and Okamoto, Kouji and Sakabe, Toshiki},
 journal = {Proceedings of 3rd International Workshop on Reduction Strategies in Rewriting and Programming},
 month = {Jun},
 note = {A strategy of TRSs is said to be complete if all normal forms of a given term are reachable from the term. We show the innermost strategy is complete for terminating, right-linear and overlay TRSs. This strategy is fairly efficient to calculate all normal forms of a given term by searching reduction trees. We also discuss the possibilities for weakening the conditions.},
 pages = {79--88},
 title = {Innermost Reductions Find All Normal Forms on Right-Linear Terminating Overlay TRSs},
 year = {2003}
}