Pages that link to "Item:Q1176247"
From MaRDI portal
The following pages link to Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247):
Displaying 33 items.
- Infinitary combinatory reduction systems (Q550248) (← links)
- Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Infinitary rewriting: meta-theory and convergence (Q884993) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Orders, reduction graphs and spectra (Q1275630) (← links)
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
- Projections for infinitary rewriting (Q1744449) (← links)
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems (Q1764798) (← links)
- Some results on extensionality in lambda calculus (Q1765154) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Head boundedness of nonterminating rewritings (Q1894332) (← links)
- Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- On confluence and residuals in Cauchy convergent transfinite rewriting (Q2390300) (← links)
- Projections for infinitary rewriting (extended version) (Q2424890) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- On the complexity of stream equality (Q2875229) (← links)
- Modularity of Convergence in Infinitary Rewriting (Q3636826) (← links)
- Convergence in infinitary term graph rewriting systems is simple (Q4585010) (← links)
- (Q4600775) (← links)
- Algebra and automated deduction (Q4647540) (← links)
- Redex capturing in term graph rewriting (concise version) (Q5055745) (← links)
- Open problems in rewriting (Q5055780) (← links)
- More problems in rewriting (Q5055812) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- CPO models for infinite term rewriting (Q5096397) (← links)
- Rational rewriting (Q5096902) (← links)
- Infinitary affine proofs (Q5268998) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Computing in unpredictable environments: Semantics, reduction strategies, and program transformations (Q5878908) (← links)
