Pages that link to "Item:Q1332336"
From MaRDI portal
The following pages link to Termination of term rewriting: Interpretation and type elimination (Q1332336):
Displaying 50 items.
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- Natural termination (Q673622) (← links)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- An initial algebra approach to term rewriting systems with variable binders (Q853743) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions (Q1575247) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Termination of rewrite systems by elementary interpretations (Q1805401) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Undecidable properties on length-two string rewriting systems (Q2873677) (← links)
- A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy (Q2946765) (← links)
- Layer Systems for Proving Confluence (Q2946770) (← links)
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation (Q2980975) (← links)
- Normalization of Infinite Terms (Q3522036) (← links)
- Proving Confluence of Term Rewriting Systems Automatically (Q3636821) (← links)
- Proving Infinitary Normalization (Q3638246) (← links)
- The order types of termination orderings on monadic terms, strings and multisets (Q4358058) (← links)
- Transforming termination by self-labelling (Q4647535) (← links)
- Explicit Substitutions à la de Bruijn (Q4924548) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Total termination of term rewriting (Q5055796) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Dummy elimination in equational rewriting (Q5055853) (← links)
- Dummy elimination: Making termination easier (Q5055895) (← links)
- Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding (Q5058367) (← links)
- Operational Termination of Membership Equational Programs: the Order-Sorted Way (Q5179140) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
