Pages that link to "Item:Q5692154"
From MaRDI portal
The following pages link to Transformation techniques for context-sensitive rewrite systems (Q5692154):
Displayed 20 items.
- Relaxing monotonicity for innermost termination (Q835006) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting (Q2808236) (← links)
- Lazy Rewriting and Context-Sensitive Rewriting (Q2841298) (← links)
- Improving the Context-sensitive Dependency Graph (Q2867962) (← links)
- Proving Termination of Context-Sensitive Rewriting with MU-TERM (Q2867963) (← links)
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation (Q2980975) (← links)
- Proving Termination Properties with mu-term (Q3067476) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- Loops under Strategies (Q3636816) (← links)
- (Q4993332) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)