Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
From MaRDI portal
Publication:5096744
DOI10.1007/3-540-59293-8_208zbMATH Open1496.68165OpenAlexW1554099449MaRDI QIDQ5096744FDOQ5096744
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counterexamples to termination for the direct sum of term rewriting systems
- On the Church-Rosser property 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination for the direct sum of left-linear term rewriting systems
Cited In (9)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some characteristics of strong innermost normalization
- Title not available (Why is that?)
- Modularity of termination in term graph rewriting
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)
