Pages that link to "Item:Q859833"
From MaRDI portal
The following pages link to Proving termination of context-sensitive rewriting by transformation (Q859833):
Displaying 12 items.
- Context-sensitive dependency pairs (Q989290) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting (Q2808236) (← links)
- Improving the Context-sensitive Dependency Graph (Q2867962) (← links)
- Proving Termination of Context-Sensitive Rewriting with MU-TERM (Q2867963) (← links)
- Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems (Q2873675) (← links)
- Termination of Lazy Rewriting Revisited (Q2873676) (← links)
- Proving Termination Properties with mu-term (Q3067476) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Automatic Proofs of Termination With Elementary Interpretations (Q5170190) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
