The following pages link to (Q3408137):
Displayed 10 items.
- Proving weak properties of rewriting (Q554217) (← links)
- Relaxing monotonicity for innermost termination (Q835006) (← links)
- On proving \(C_E\)-termination of rewriting by size-change termination (Q835016) (← 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)
- Match-bounds revisited (Q1041044) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)