Pages that link to "Item:Q2460908"
From MaRDI portal
The following pages link to Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908):
Displaying 7 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Normal Higher-Order Termination (Q2946769) (← 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)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- (Q5089009) (← links)
- Term Rewriting and Applications (Q5703843) (← links)