Pages that link to "Item:Q5901559"
From MaRDI portal
The following pages link to Rewriting Techniques and Applications (Q5901559):
Displaying 6 items.
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
- The Strength of the SCT Criterion (Q2988827) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- (Q5089009) (← links)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
