Pages that link to "Item:Q2368072"
From MaRDI portal
The following pages link to Completeness of combinations of constructor systems (Q2368072):
Displaying 20 items.
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Modularity in noncopying term rewriting (Q673186) (← links)
- Modular aspects of term graph rewriting (Q1275016) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- Interaction nets and term-rewriting systems (Q1389438) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Some characteristics of strong innermost normalization (Q1575274) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- (Q3704882) (← links)
- Completeness of combinations of constructor systems (Q5055759) (← links)
- On proving termination by innermost termination (Q5055854) (← links)
- Modularity of termination in term graph rewriting (Q5055863) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems (Q5096744) (← links)
- Completeness of combinations of conditional constructor systems (Q5881177) (← links)
- Proving confluence in the confluence framework with confident (Q6622001) (← links)
