From Outermost to Context-Sensitive Rewriting

DOI10.1007/978-3-642-02348-4_22zbMath1242.68129OpenAlexW2133307358MaRDI QIDQ3636831

Jörg Endrullis, Dimitri Hendriks

Publication date: 30 June 2009

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/b4e1e337-d0c6-4277-88b5-97a045ca57c1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Lazy productivity via termination ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Context-sensitive dependency pairs ⋮ Applications and extensions of context-sensitive rewriting

Uses Software

• CARIBOO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of term rewriting using dependency pairs
• Termination Competition (termCOMP 2015)
• From Outermost Termination to Innermost Termination
• Matrix Interpretations for Proving Termination of Term Rewriting
• A Transformational Approach to Prove Outermost Termination Automatically
• Improving Context-Sensitive Dependency Pairs

This page was built for publication: From Outermost to Context-Sensitive Rewriting