Pages that link to "Item:Q3540166"
From MaRDI portal
The following pages link to The Computability Path Ordering: The End of a Quest (Q3540166):
Displaying 6 items.
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- A Knuth-Bendix-like ordering for orienting combinator equations (Q2096451) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
- Simplifying Algebraic Functional Systems (Q3014941) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
