Transforming termination by self-labelling
From MaRDI portal
Publication:4647535
Recommendations
Cites work
- scientific article; zbMATH DE number 4180808 (Why is no real title available?)
- scientific article; zbMATH DE number 4047065 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (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 794240 (Why is no real title available?)
- Counterexamples to termination for the direct sum of term rewriting systems
- Dummy elimination: Making termination easier
- Modular proofs for completeness of hierarchical term rewriting systems
- Modular properties of composable term rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Orderings for term-rewriting systems
- Termination by completion
- Termination of rewriting
- Termination of term rewriting: Interpretation and type elimination
Cited in
(10)- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- scientific article; zbMATH DE number 1670496 (Why is no real title available?)
- Extending reduction orderings to ACU-compatible reduction orderings
- scientific article; zbMATH DE number 7559287 (Why is no real title available?)
- Size-based termination of higher-order rewriting
- Root-Labeling
- Modular and certified semantic labeling and unlabeling
- scientific article; zbMATH DE number 7566074 (Why is no real title available?)
- Dummy elimination: Making termination easier
- Complexity analysis of precedence terminating infinite graph rewrite systems
This page was built for publication: Transforming termination by self-labelling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647535)