The following pages link to (Q4938611):
Displaying 5 items.
- An initial algebra approach to term rewriting systems with variable binders (Q853743) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- A domain model characterising strong normalisation (Q958484) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
