Pages that link to "Item:Q1041807"
From MaRDI portal
The following pages link to Operational termination of conditional term rewriting systems (Q1041807):
Displayed 38 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← 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)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Determinization of conditional term rewriting systems (Q1929232) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Determinization of inverted grammar programs via context-free expressions (Q1979968) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Stability of termination and sufficient-completeness under pushouts via amalgamation (Q2215962) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← 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)
- Transformation for Refining Unraveled Conditional Term Rewriting Systems (Q2866802) (← links)
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
- Rewriting Strategies and Strategic Rewrite Programs (Q2945718) (← links)
- Formalizing Soundness and Completeness of Unravelings (Q2964466) (← links)
- (Q2980968) (← links)
- MTT: The Maude Termination Tool (System Description) (Q3541712) (← links)
- Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (Q4993358) (← links)
- Automatically Proving and Disproving Feasibility Conditions (Q5049020) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Completion after Program Inversion of Injective Functions (Q5170160) (← 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)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (Q5240136) (← links)
- Localized Operational Termination in General Logics (Q5256340) (← links)
- Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications (Q5403069) (← links)
- Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)