Pages that link to "Item:Q1854569"
From MaRDI portal
The following pages link to Context-sensitive rewriting strategies (Q1854569):
Displaying 40 items.
- Completeness of context-sensitive rewriting (Q477588) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Strong and NV-sequentiality of constructor systems (Q1029079) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Scattered versus context-sensitive rewriting (Q1115634) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Modular termination of prefix-constrained term rewrite systems (Q2059889) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Metalevel transformation of strategies (Q2667189) (← links)
- Using context-sensitive rewriting for proving innermost termination of rewriting (Q2808236) (← links)
- Methods for proving termination of rewriting-based programming languages by transformation (Q2808239) (← links)
- Induction for termination with local strategies (Q2841240) (← links)
- Lazy rewriting and context-sensitive rewriting (Q2841298) (← links)
- Strategic rewriting (Q2849580) (← links)
- Correct and complete (positive) strategy annotations for \textsf{OBJ} (Q2851049) (← links)
- Improving the context-sensitive dependency graph (Q2867962) (← links)
- Proving termination of context-sensitive rewriting with MU-TERM (Q2867963) (← links)
- Two Decades of Maude (Q2945709) (← links)
- (Q2980968) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- MTT: The Maude Termination Tool (System Description) (Q3541712) (← links)
- Transforming Outermost into Context-Sensitive Rewriting (Q3575304) (← links)
- (Q3787463) (← links)
- (Q4222858) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Operational Termination of Membership Equational Programs: the Order-Sorted Way (Q5179140) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Context rewriting (Q5881173) (← links)
- An Overview of the Maude Strategy Language and its Applications (Q6487295) (← links)
