On the modularity of termination of term rewriting systems
From MaRDI portal
Recommendations
- Generalized sufficient conditions for modular termination of rewriting
- scientific article; zbMATH DE number 1456966
- Modularity of simple termination of term rewriting systems with shared constructors
- scientific article; zbMATH DE number 40801
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Cites work
- scientific article; zbMATH DE number 4180808 (Why is no real title available?)
- scientific article; zbMATH DE number 3930339 (Why is no real title available?)
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 1354152 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1995150 (Why is no real title available?)
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- scientific article; zbMATH DE number 194506 (Why is no real title available?)
- scientific article; zbMATH DE number 1456966 (Why is no real title available?)
- A note on simplification orderings
- Combinations of simplifying conditional term rewriting systems
- Completeness of combinations of constructor systems
- Counterexamples to termination for the direct sum of term rewriting systems
- Extensions and comparison of simplification orderings
- Generalized sufficient conditions for modular termination of rewriting
- Modular properties of conditional term rewriting systems
- Modularity of simple termination of term rewriting systems with shared constructors
- On termination of the direct sum of term-rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Proving termination with multiset orderings
- Simple termination is difficult
- Sufficient conditions for modular termination of conditional term rewriting systems
- Termination for direct sums of left-linear complete term rewriting systems
- Termination is not modular for confluent variable-preserving term rewriting systems
- Termination of term rewriting by interpretation
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
Cited in
(32)- On modularity in infinitary term rewriting
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- scientific article; zbMATH DE number 794237 (Why is no real title available?)
- Modularity of simple termination of term rewriting systems with shared constructors
- Overlap closures do not suffice for termination of general term rewriting systems
- On proving \(C_E\)-termination of rewriting by size-change termination
- Modularity of termination and confluence in combinations of rewrite systems with \(\lambda_\omega\)
- A local termination property for term rewriting systems
- Some characteristics of strong innermost normalization
- scientific article; zbMATH DE number 7566074 (Why is no real title available?)
- From diagrammatic confluence to modularity
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- The theory of vaccines
- Sufficient conditions for modular termination of conditional term rewriting systems
- Modular term rewriting systems and the termination
- Bubbles in modularity
- On proving termination by innermost termination
- Modular termination proofs for rewriting using dependency pairs
- On modularity in term rewriting and narrowing
- Modular proofs for completeness of hierarchical term rewriting systems
- Modular termination of graph transformation
- Modular termination of prefix-constrained term rewrite systems
- Harnessing first order termination provers using higher order dependency pairs
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Modular properties of conditional term rewriting systems
- Modular and incremental proofs of AC-termination
- Modularity in term rewriting revisited
- Simple termination of rewrite systems
- On the specification of visual languages: multisets as first-class citizens
- scientific article; zbMATH DE number 40801 (Why is no real title available?)
- Termination Modulo Combinations of Equational Theories
- Modular and incremental automated termination proofs
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)
