Pages that link to "Item:Q1176244"
From MaRDI portal
The following pages link to Polymorphic rewriting conserves algebraic strong normalization (Q1176244):
Displaying 10 items.
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
- Abstract data type systems (Q1391729) (← links)
- Normal forms in combinatory logic (Q1903133) (← links)
- Higher-order unification via combinators (Q2367541) (← links)
- Nominal rewriting (Q2373703) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
