The following pages link to (Q2783416):
Displaying 50 items.
- Rota's classification problem, rewriting systems and Gröbner-Shirshov bases (Q335602) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Decreasing diagrams and relative termination (Q438562) (← 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)
- Algebraic simulations (Q844884) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529) (← links)
- On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Rewriting systems over similarity and generalized pseudometric spaces and their properties (Q1677217) (← links)
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems (Q1736602) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Free operated monoids and rewriting systems (Q1756691) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Modularity in term rewriting revisited (Q1929227) (← 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)
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality (Q2049986) (← links)
- Modular termination of prefix-constrained term rewrite systems (Q2059889) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Confluence and commutation for nominal rewriting systems with atom-variables (Q2119102) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← 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)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- Confluence by critical pair analysis revisited (Q2305423) (← links)
- Conditions for confluence of innermost terminating term rewriting systems (Q2321950) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- Conversion to tail recursion in term rewriting (Q2436518) (← links)
- Confluence theory for graphs (Q2464760) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Methods for Proving Termination of Rewriting-based Programming Languages by Transformation (Q2808239) (← links)
