The following pages link to Uncurrying for Termination (Q5505588):
Displaying 7 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Simplifying Algebraic Functional Systems (Q3014941) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Generalized and Formalized Uncurrying (Q3172898) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
