The following pages link to The computability path ordering (Q3196359):
Displaying 9 items.
- 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 Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- (Q5094148) (← links)
- Superposition with lambdas (Q5918381) (← links)
- Superposition with lambdas (Q5919500) (← links)
- Superposition for higher-order logic (Q6156638) (← links)
- A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems (Q6486041) (← links)
