Pages that link to "Item:Q3546327"
From MaRDI portal
The following pages link to Polymorphic higher-order recursive path orderings (Q3546327):
Displayed 15 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- A Knuth-Bendix-like ordering for orienting combinator equations (Q2096451) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- HORPO with Computability Closure: A Reconstruction (Q3498461) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- (Q5089012) (← links)
- (Q5094148) (← links)
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
- Superposition with lambdas (Q5918381) (← links)
- Superposition with lambdas (Q5919500) (← links)