Pages that link to "Item:Q2271899"
From MaRDI portal
The following pages link to Proving operational termination of membership equational programs (Q2271899):
Displayed 28 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← 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)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← 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)
- Use of Logical Models for Proving Operational Termination in General Logics (Q2827835) (← links)
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
- Formalizing Soundness and Completeness of Unravelings (Q2964466) (← links)
- Transformations of Conditional Rewrite Systems Revisited (Q3184732) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- MTT: The Maude Termination Tool (System Description) (Q3541712) (← links)
- Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
- Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures (Q5170162) (← links)
- Operational Termination of Membership Equational Programs: the Order-Sorted Way (Q5179140) (← links)
- (Q5240136) (← links)
- Localized Operational Termination in General Logics (Q5256340) (← links)