Pages that link to "Item:Q2808239"
From MaRDI portal
The following pages link to Methods for proving termination of rewriting-based programming languages by transformation (Q2808239):
Displaying 9 items.
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Transformational methodology for proving termination of logic programs (Q3841095) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)