A recursively defined ordering for proving termination of term rewriting systems
By: by David A. Plaisted.
Series: [Report] - UIUCDCS-R-78 ; 943
Publisher: Dept. of Computer Science, University of Illinois at Urbana-Champaign
Published: 1978
Place of publication: Urbana
Language: eng
Number of pages: 53
Subjects: Computer programming.; Automatic theorem proving.; Rewriting systems (Computer science); Recursion theory.
Notes: Bibliography: p. 53.
"UILU-ENG 78 1736."
NSF MCS 77-22830."