Pages that link to "Item:Q1978641"
From MaRDI portal
The following pages link to Termination of term rewriting using dependency pairs (Q1978641):
Displaying 50 items.
- A combination framework for complexity (Q276251) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Paramodulation with non-monotonic orderings and simplification (Q352977) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Levels of undecidability in rewriting (Q627134) (← 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 Hydra battle and Cichon's principle (Q734036) (← links)
- Relaxing monotonicity for innermost termination (Q835006) (← links)
- On proving \(C_E\)-termination of rewriting by size-change termination (Q835016) (← links)
- KBO orientability (Q846165) (← links)
- Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Some classes of term rewriting systems inferable from positive data (Q924174) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Adding constants to string rewriting (Q945008) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- On normalizing, non-terminating one-rule string rewriting systems (Q1575660) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Hierarchical termination revisited. (Q1853138) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Determinization of conditional term rewriting systems (Q1929232) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
