Pages that link to "Item:Q1349693"
From MaRDI portal
The following pages link to On the modularity of termination of term rewriting systems (Q1349693):
Displaying 32 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)
- Modular properties of conditional term rewriting systems (Q689098) (← links)
- On proving \(C_E\)-termination of rewriting by size-change termination (Q835016) (← links)
- Modular term rewriting systems and the termination (Q910207) (← links)
- Overlap closures do not suffice for termination of general term rewriting systems (Q922713) (← links)
- Bubbles in modularity (Q1127335) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Some characteristics of strong innermost normalization (Q1575274) (← links)
- Modular termination of graph transformation (Q1708192) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Modular properties of composable term rewriting systems (Q1911401) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- From diagrammatic confluence to modularity (Q1929228) (← links)
- Modular termination of prefix-constrained term rewrite systems (Q2059889) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← 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)
- Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
- The theory of vaccines (Q4571995) (← links)
- A local termination property for term rewriting systems (Q5055724) (← links)
- On proving termination by innermost termination (Q5055854) (← links)
- (Q5094148) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- Sufficient conditions for modular termination of conditional term rewriting systems (Q5881180) (← links)
- On the specification of visual languages: multisets as first-class citizens (Q6560194) (← links)
