Counterexamples to termination for the direct sum of term rewriting systems

Recommendations

On termination of the direct sum of term-rewriting systems
scientific article; zbMATH DE number 4180808
Termination for the direct sum of left-linear term rewriting systems
Generalized sufficient conditions for modular termination of rewriting
On the Church-Rosser property for the direct sum of term rewriting systems

Cites work

scientific article; zbMATH DE number 3930339 (Why is no real title available?)
scientific article; zbMATH DE number 4047065 (Why is no real title available?)
scientific article; zbMATH DE number 3729436 (Why is no real title available?)
scientific article; zbMATH DE number 3730111 (Why is no real title available?)
On the Church-Rosser property for the direct sum of term rewriting systems

Cited in

(73)

Termination of narrowing revisited
On termination of the direct sum of term-rewriting systems
Bubbles in modularity
Modularity of simple termination of term rewriting systems with shared constructors
Modular aspects of term graph rewriting
Decidability of reachability for disjoint union of term rewriting systems
Generalized sufficient conditions for modular termination of rewriting
On the modularity of termination of term rewriting systems
Modular proofs for completeness of hierarchical term rewriting systems
Interaction nets and term-rewriting systems
Simple termination of rewrite systems
Deciding the word problem in the union of equational theories.
Some characteristics of strong innermost normalization
A uniform framework for term and graph rewriting applied to combined systems
Automatic synthesis of logical models for order-sorted first-order theories
Proof certificates for equality reasoning
Modular termination proofs for rewriting using dependency pairs
An improved general path order
Modularity in term rewriting revisited
Jumping and escaping: modular termination and the abstract path ordering
Termination of term rewriting using dependency pairs
Modular termination of prefix-constrained term rewrite systems
Automating the dependency pair method
On modularity in infinitary term rewriting
The size-change principle and dependency pairs for termination of term rewriting
Modular and incremental automated termination proofs
Modular and incremental proofs of AC-termination
scientific article; zbMATH DE number 4180808 (Why is no real title available?)
Modular Termination of Basic Narrowing
Maximal Termination
Root-Labeling
Proving termination by dependency pairs and inductive theorem proving
Finding small counterexamples for abstract rewriting properties
Modularity of termination and confluence in combinations of rewrite systems with _
Extension orderings
Transforming termination by self-labelling
Variant-Based Satisfiability in Initial Algebras
Essentials of term graph rewriting
Modular aspects of properties of term rewriting systems related to normal forms
Termination for the direct sum of left-linear term rewriting systems
Completeness of combinations of constructor systems
Modularity of termination in term graph rewriting
scientific article; zbMATH DE number 7566074 (Why is no real title available?)
Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
Completeness of combinations of conditional constructor systems
Collapsed tree rewriting: Completeness, confluence, and modularity
Combinations of simplifying conditional term rewriting systems
Type removal in term rewriting
Termination of term rewriting by interpretation
Confluence of the disjoint union of conditional term rewriting systems
Implementing term rewriting by graph reduction: Termination of combined systems
Analyzing Innermost Runtime Complexity Through Tuple Interpretations
From innermost to full almost-sure termination of probabilistic term rewriting
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Intersection type assignment systems with higher-order algebraic rewriting
Modular termination of \(r\)-consistent and left-linear term rewriting systems
Modularity in noncopying term rewriting
Termination is not modular for confluent variable-preserving term rewriting systems
Factorize factorization
Wanda -- a higher-order termination tool (system description)
Type safety of rewrite rules in dependent types
From innermost to full probabilistic term rewriting: almost-sure termination, complexity, and modularity
Implementing field extensions of the form Q[sqrt(b)]
Tyrolean termination tool: techniques and features
Mechanizing and improving dependency pairs
Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
Modular term rewriting systems and the termination
Overlap closures do not suffice for termination of general term rewriting systems
Some classes of term rewriting systems inferable from positive data
Loop detection in term rewriting using the eliminating unfoldings
A domain model characterising strong normalisation

This page was built for publication: Counterexamples to termination for the direct sum of term rewriting systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107975)