𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Datatype-Generic Termination Proofs

✍ Scribed by Roland Backhouse; Henk Doornbos

Publisher
Springer
Year
2007
Tongue
English
Weight
526 KB
Volume
43
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Modular Termination Proofs for Rewriting
Modular Termination Proofs for Rewriting Using Dependency Pairs
✍ JΓΌrgen Giesl; Thomas Arts; Enno Ohlebusch πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 524 KB

Recently, Arts and Giesl developed the dependency pair approach which allows automated termination and innermost termination proofs for many term rewriting systems (TRSs) for which such proofs were not possible before. The motivation for this approach was that virtually all previous techniques for a