Narrowing-based simulation of term rewriting systems with extra variables and its termination proof

MaRDI QIDQ2844056zbMATH OpenFDO

Authors Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Publication date 27 August 2013

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Termination of narrowing revisited
• Termination of narrowing via termination of rewriting
• Termination of Narrowing in Left-Linear Constructor Systems
• Goal-directed and relative dependency pairs for proving the termination of narrowing
• Term Rewriting and Applications

Cited in

(6)

• Relative termination via dependency pairs
• Transformation for refining unraveled conditional term rewriting systems
• Reducing relative termination to dependency pair problems
• Termination of Narrowing in Left-Linear Constructor Systems
• Termination of Narrowing Using Dependency Pairs
• Termination of narrowing via termination of rewriting

This page was built for publication: Narrowing-based simulation of term rewriting systems with extra variables and its termination proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844056)