Pages that link to "Item:Q1978641"
From MaRDI portal
The following pages link to Termination of term rewriting using dependency pairs (Q1978641):
Displayed 50 items.
- 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)
- 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)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- On normalizing, non-terminating one-rule string rewriting systems (Q1575660) (← 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)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Termination orders for three-dimensional rewriting (Q2504386) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Effectively Checking the Finite Variant Property (Q3522010) (← links)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
- Maximal Termination (Q3522012) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Arctic Termination ...Below Zero (Q3522019) (← links)
- Root-Labeling (Q3522028) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Normalization of Infinite Terms (Q3522036) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- All-Termination(T) (Q3617771) (← links)
- Automatic Termination (Q3636815) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- Well-Definedness of Streams by Termination (Q3636825) (← links)
- Local Termination (Q3636830) (← links)
- From Outermost to Context-Sensitive Rewriting (Q3636831) (← links)
- Termination checking with types (Q4659886) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations (Q5448658) (← links)