Pages that link to "Item:Q1763429"
From MaRDI portal
The following pages link to Decidable call-by-need computations in term rewriting (Q1763429):
Displaying 12 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Bottom-up rewriting for words and terms (Q741256) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- (Q2769431) (← links)
- Approximations for strategies and termination (Q2843601) (← links)
- Call-by-need reduction for membership conditional term rewriting systems (Q2844071) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Stable results and relative normalization (Q4500174) (← links)
- Beyond Dependency Graphs (Q5191112) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)
- Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)