Modular termination of r-consistent and left-linear term rewriting systems
From MaRDI portal
(Redirected from Modular termination of r-consistent and left-linear term rewriting systems)
Modular termination of \(r\)-consistent and left-linear term rewriting systems
Modular termination of \(r\)-consistent and left-linear term rewriting systems
Recommendations
Cites work
- Completeness of combinations of constructor systems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Counterexamples to termination for the direct sum of term rewriting systems
- 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 40801 (Why is no real title available?)
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 1324443 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 194506 (Why is no real title available?)
- Input-Termination of Logic Programs
- Modular properties of composable term rewriting systems
- Modular properties of conditional term rewriting systems
- Modularity of completeness revisited
- On termination of 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
- Termination of rewriting
- Unification in a combination of arbitrary disjoint equational theories
Cited in
(12)- Bubbles in modularity
- Generalized sufficient conditions for modular termination of rewriting
- Right-linear half-monadic term rewrite systems
- Modularity in term rewriting revisited
- On modularity in infinitary term rewriting
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- The theory of vaccines
- Modular aspects of properties of term rewriting systems related to normal forms
- On proving termination by innermost termination
- scientific article; zbMATH DE number 7566074 (Why is no real title available?)
- On the specification of visual languages: multisets as first-class citizens
- Modular term rewriting systems and the termination
This page was built for publication: Modular termination of \(r\)-consistent and left-linear term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672714)