The following pages link to Tyrolean (Q19846):
Displaying 50 items.
- A combination framework for complexity (Q276251) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Multi-completion with termination tools (Q352956) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Decreasing diagrams and relative termination (Q438562) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Reachability, confluence, and termination analysis with state-compatible automata (Q515687) (← links)
- KBO orientability (Q846165) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- SGGS decision procedures (Q2096457) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems (Q2405266) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Methods for Proving Termination of Rewriting-based Programming Languages by Transformation (Q2808239) (← links)
- Nominal Confluence Tool (Q2817917) (← links)
- Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering (Q2849497) (← links)
- Proving Termination of Context-Sensitive Rewriting with MU-TERM (Q2867963) (← links)
- Innermost Termination of Rewrite Systems by Labeling (Q2873673) (← links)
- A Tool Proving Well-Definedness of Streams Using Termination Tools (Q2888504) (← links)
- Dynamic Dependency Pairs for Algebraic Functional Systems (Q2895471) (← links)
- KBCV – Knuth-Bendix Completion Visualizer (Q2908523) (← links)
- Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited (Q2921119) (← links)
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation (Q2980975) (← links)
- KBOs, ordinals, subrecursive hierarchies and all that (Q2987062) (← links)
- (Q3077191) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Generalized and Formalized Uncurrying (Q3172898) (← links)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
