Some characteristics of strong innermost normalization

DOI10.1016/S0304-3975(99)00215-7zbMath0944.68081MaRDI QIDQ1575274

M. R. K. Krishna Rao

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

term rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Uncurrying for termination and complexity ⋮ Unnamed Item ⋮ Induction for termination with local strategies

Cites Work

• Counterexamples to termination for the direct sum of term rewriting systems
• Modular aspects of term graph rewriting
• On the modularity of termination of term rewriting systems
• Completeness of combinations of constructor systems
• The integration of functions into logic programming: From theory to practice
• Proving innermost normalisation automatically
• On proving termination by innermost termination
• Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some characteristics of strong innermost normalization