Pages that link to "Item:Q5055816"
From MaRDI portal
The following pages link to A termination ordering for higher order rewrite systems (Q5055816):
Displaying 20 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015) (← links)
- Abstract data type systems (Q1391729) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
- (Q4035223) (← links)
- The recursive path and polynomial ordering for first-order and higher-order terms (Q4914419) (← links)
- Bi-rewriting, a term rewriting technique for monotonic order relations (Q5055782) (← links)
- Topics in termination (Q5055795) (← links)
- A recursive path ordering for higher-order terms in η-long β-normal form (Q5055855) (← links)
- Linear second-order unification (Q5055871) (← links)
- Graph Path Orderings (Q5222963) (← links)
- Partial Order Infinitary Term Rewriting (Q5419490) (← links)
- The practice of logical frameworks (Q5878905) (← links)
- Could orders be captured by term rewriting systems? (Q5881195) (← links)
- Rewriting Techniques and Applications (Q5901561) (← links)
- Currying of order-sorted term rewriting systems (Q6085707) (← links)
- A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems (Q6486041) (← links)
- Higher-order proof by consistency (Q6567778) (← links)
