scientific article

zbMath1272.68181MaRDI QIDQ2851054

Hélène Kirchner, Olivier Fissore, Isabelle Gnaedig

Publication date: 2 October 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105825356

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Unnamed Item ⋮ Proving weak properties of rewriting

Uses Software

• ELAN
• Maude
• CARIBOO
• REVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of rewriting systems by polynomial interpretations and its implementation
• Orderings for term-rewriting systems
• Natural termination
• Completeness results for basic narrowing
• Some characteristics of strong innermost normalization
• Termination of term rewriting using dependency pairs
• Compact Normalisation Trace via Lazy Rewriting
• Induction for termination with local strategies
• Termination of Rewriting with Strategy Annotations
• Proving innermost normalisation automatically
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

This page was built for publication: