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

DOI10.1007/3-540-59293-8_208MaRDI QIDQ5096744zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Modular proofs for completeness of hierarchical term rewriting systems
• scientific article; zbMATH DE number 1479616
• Completeness of combinations of constructor systems
• scientific article; zbMATH DE number 1456966
• Completeness of combinations of constructor systems

Cites work

• scientific article; zbMATH DE number 4180808 (Why is no real title available?)
• scientific article; zbMATH DE number 3478840 (Why is no real title available?)
• scientific article; zbMATH DE number 1324443 (Why is no real title available?)
• scientific article; zbMATH DE number 1354152 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1479616 (Why is no real title available?)
• scientific article; zbMATH DE number 1456966 (Why is no real title available?)
• Completeness of combinations of constructor systems
• Counterexamples to termination for the direct sum of term rewriting systems
• Generalized sufficient conditions for modular termination of rewriting
• Modularity of simple termination of term rewriting systems with shared constructors
• On termination of the direct sum of term-rewriting systems
• On the Church-Rosser property for the direct sum of term rewriting systems
• Termination for the direct sum of left-linear term rewriting systems

Cited in

(9)

• Modularity of termination in term graph rewriting
• Modularity in term rewriting revisited
• Modular proofs for completeness of hierarchical term rewriting systems
• Modular aspects of term graph rewriting
• On sufficient-completeness and related properties of term rewriting systems
• scientific article; zbMATH DE number 3878354 (Why is no real title available?)
• scientific article; zbMATH DE number 1479616 (Why is no real title available?)
• Some characteristics of strong innermost normalization
• scientific article; zbMATH DE number 4164136 (Why is no real title available?)

This page was built for publication: Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems

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