The following pages link to (Q4447246):
Displaying 6 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
