Pages that link to "Item:Q3527281"
From MaRDI portal
The following pages link to Computationally Equivalent Elimination of Conditions (Q3527281):
Displaying 11 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Transformation for Refining Unraveled Conditional Term Rewriting Systems (Q2866802) (← links)
- (Q2980968) (← links)
- Transformations of Conditional Rewrite Systems Revisited (Q3184732) (← links)
- Completion after Program Inversion of Injective Functions (Q5170160) (← links)
- Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (Q5240131) (← links)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (Q5240136) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
