Pages that link to "Item:Q1328180"
From MaRDI portal
The following pages link to Generalized sufficient conditions for modular termination of rewriting (Q1328180):
Displaying 41 items.
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- Modularity in noncopying term rewriting (Q673186) (← links)
- Termination is not modular for confluent variable-preserving term rewriting systems (Q674186) (← links)
- Modular properties of conditional term rewriting systems (Q689098) (← links)
- On proving \(C_E\)-termination of rewriting by size-change termination (Q835016) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Modular term rewriting systems and the termination (Q910207) (← links)
- Overlap closures do not suffice for termination of general term rewriting systems (Q922713) (← links)
- Counterexamples to termination for the direct sum of term rewriting systems (Q1107975) (← links)
- On termination of the direct sum of term-rewriting systems (Q1108785) (← links)
- Bubbles in modularity (Q1127335) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Modular aspects of term graph rewriting (Q1275016) (← links)
- Decidability of reachability for disjoint union of term rewriting systems (Q1325846) (← links)
- Simple termination is difficult (Q1343111) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Remarks on Thatte's transformation of term rewriting systems (Q1763376) (← links)
- Hierarchical termination revisited. (Q1853138) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Head boundedness of nonterminating rewritings (Q1894332) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Modular termination of prefix-constrained term rewrite systems (Q2059889) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- The theory of vaccines (Q4571995) (← links)
- On proving termination by innermost termination (Q5055854) (← links)
- Modularity of termination in term graph rewriting (Q5055863) (← links)
- (Q5094148) (← links)
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems (Q5096744) (← links)
- Computer Science Logic (Q5311249) (← links)
- Collapsed tree rewriting: Completeness, confluence, and modularity (Q5881178) (← links)
- Sufficient conditions for modular termination of conditional term rewriting systems (Q5881180) (← links)
- Design strategies for rewrite rules (Q5881289) (← links)
