Termination of constructor systems
From MaRDI portal
Publication:5055852
DOI10.1007/3-540-61464-8_43zbMATH Open1503.68085OpenAlexW2144449052MaRDI QIDQ5055852FDOQ5055852
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61464-8_43
Cites Work
- 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- InKa
- CLAM
- Termination of rewriting systems by polynomial interpretations and its implementation
- Termination of term rewriting: Interpretation and type elimination
- Orderings for term-rewriting systems
- Termination of rewriting
- Semantic confluence tests and completion methods
- A note on simplification orderings
- An improved general path order
- Natural termination
- The OYSTER-CLAM system
- Termination by completion
- Modular proofs for completeness of hierarchical term rewriting systems
- Proving termination of (conditional) rewrite systems. A semantic approach
- Generating polynomial orderings
- Generating polynomial orderings for termination proofs
- Dummy elimination: Making termination easier
- Termination by absence of infinite chains of dependency pairs
- Automatic termination proofs with transformation orderings
- Termination of constructor systems
Cited In (3)
Uses Software
This page was built for publication: Termination of constructor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055852)
