Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems

DOI10.1007/3-540-59293-8_208zbMath1496.68165OpenAlexW1554099449MaRDI QIDQ5096744

M. R. K. Krishna Rao

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_208

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Modularity of termination in term graph rewriting, Modular proofs for completeness of hierarchical term rewriting systems, Modularity in term rewriting revisited, Modular aspects of term graph rewriting, Some characteristics of strong innermost normalization

Cites Work

• Counterexamples to termination for the direct sum of term rewriting systems
• On termination of the direct sum of term-rewriting systems
• Modularity of simple termination of term rewriting systems with shared constructors
• Generalized sufficient conditions for modular termination of rewriting
• Completeness of combinations of constructor systems
• Termination for the direct sum of left-linear term rewriting systems
• On the Church-Rosser property for the direct sum of term rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item