On the modularity of termination of term rewriting systems
From MaRDI portal
Publication:1349693
DOI10.1016/0304-3975(94)00039-LzbMATH Open0874.68154OpenAlexW2031948276MaRDI QIDQ1349693FDOQ1349693
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00039-l
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proving termination with multiset orderings
- Extensions and comparison of simplification orderings
- Modular properties of conditional term rewriting systems
- Counterexamples to termination for the direct sum of term rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Termination for direct sums of left-linear complete term rewriting systems
- A note on simplification orderings
- Sufficient conditions for modular termination of conditional term rewriting systems
- Simple termination is difficult
- 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
- Termination is not modular for confluent variable-preserving term rewriting systems
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- Combinations of simplifying conditional term rewriting systems
- Termination of term rewriting by interpretation
Cited In (25)
- The theory of vaccines
- Modularity in term rewriting revisited
- Modularity of simple termination of term rewriting systems with shared constructors
- On the specification of visual languages: multisets as first-class citizens
- Simple termination of rewrite systems
- On proving \(C_E\)-termination of rewriting by size-change termination
- Modular proofs for completeness of hierarchical term rewriting systems
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Bubbles in modularity
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Modular termination of prefix-constrained term rewrite systems
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
- Modular termination proofs for rewriting using dependency pairs
- Title not available (Why is that?)
- On proving termination by innermost termination
- Modular and incremental automated termination proofs
- From diagrammatic confluence to modularity
- Termination Modulo Combinations of Equational Theories
- Modular properties of conditional term rewriting systems
- A local termination property for term rewriting systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular and incremental proofs of AC-termination
- On modularity in term rewriting and narrowing
- Some characteristics of strong innermost normalization
Recommendations
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems 👍 👎
- Modularity of simple termination of term rewriting systems with shared constructors 👍 👎
- Generalized sufficient conditions for modular termination of rewriting 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: On the modularity of termination of term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349693)
