The following pages link to (Q2778883):
Displaying 6 items.
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- An effective proof of the well-foundedness of the multiset path ordering (Q857884) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Expression reduction systems with patterns (Q2467565) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
