Transforming termination by self-labelling
From MaRDI portal
Publication:4647535
DOI10.1007/3-540-61511-3_101zbMATH Open1412.68112OpenAlexW2024932951MaRDI QIDQ4647535FDOQ4647535
Authors: Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema 
Publication date: 15 January 2019
Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/18323
Recommendations
Cites Work
- Termination of term rewriting: Interpretation and type elimination
- Orderings for term-rewriting systems
- Termination of rewriting
- Title not available (Why is that?)
- Modular properties of composable term rewriting systems
- 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
- 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 by completion
- Modular proofs for completeness of hierarchical term rewriting systems
- Dummy elimination: Making termination easier
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending reduction orderings to ACU-compatible reduction orderings
- Size-based termination of higher-order rewriting
- Root-Labeling
- Modular and certified semantic labeling and unlabeling
- Title not available (Why is that?)
- 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)
