๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Termination of rewrite systems by elementary interpretations

โœ Scribed by Pierre Lescanne

Book ID
105121531
Publisher
Springer
Year
1995
Tongue
English
Weight
827 KB
Volume
7
Category
Article
ISSN
0934-5043

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Termination of term rewriting: interpret
Termination of term rewriting: interpretation and type elimination
โœ H. Zantema ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 886 KB

We investigate proving termination of term rewriting systems by interpretation of terms in a well-founded monotone algebra. The well-known polynomial interpretations can be considered as a particular case in this framework. A classification of types of termination, including simple termination, is p

On termination of confluent one-rule str
On termination of confluent one-rule string-rewriting systems
โœ Kayoko Shikishima-Tsuji; Masashi Katsura; Yuji Kobayashi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 507 KB

The termination of a confluent one-rule string-rewriting system R = (s + I} is reduced to that of another one-rule system K = {s' -B t') such that s' is self-overlap-free &of). A necessary and sufficient condition is given for termination of a one-rule system R = {s --+ t} such that s is sof and s o