Pages that link to "Item:Q5503212"
From MaRDI portal
The following pages link to On the Church-Rosser property for the direct sum of term rewriting systems (Q5503212):
Displaying 40 items.
- Approximate XML structure validation based on document-grammar tree similarity (Q527155) (← links)
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- 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 term rewriting systems and the termination (Q910207) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
- Termination of rewriting (Q1098624) (← 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)
- Unique normal forms for lambda calculus with surjective pairing (Q1117204) (← links)
- Bubbles in modularity (Q1127335) (← links)
- Polymorphic rewriting conserves algebraic strong normalization (Q1176244) (← links)
- Sequentiality in orthogonal term rewriting systems (Q1186735) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Adding algebraic rewriting to the untyped lambda calculus (Q1207945) (← links)
- Term-rewriting systems with rule priorities (Q1262749) (← links)
- Modular aspects of term graph rewriting (Q1275016) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Decidability of reachability for disjoint union of term rewriting systems (Q1325846) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- Some results on the confluence property of combined term rewriting systems (Q1337642) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- Abstract data type systems (Q1391729) (← links)
- Developing developments (Q1392147) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Partial completion of equational theories (Q1592635) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- From diagrammatic confluence to modularity (Q1929228) (← links)
- Confluence and commutation for nominal rewriting systems with atom-variables (Q2119102) (← links)
- Confluence by critical pair analysis revisited (Q2305423) (← links)
- Labelings for decreasing diagrams (Q2352504) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- Layer Systems for Proving Confluence (Q2946770) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
