The following pages link to Term Rewriting and Applications (Q5703843):
Displayed 5 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)