Pages that link to "Item:Q1176244"

The following pages link to Polymorphic rewriting conserves algebraic strong normalization (Q1176244):

Displaying 21 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)
• On modular properties of higher order extensional lambda calculi (Q4571956) (← links)
• Modularity of termination and confluence in combinations of rewrite systems with λω (Q4630300) (← links)
• Modular properties of algebraic type systems (Q4645803) (← links)
• A typed, algebraic, computational lambda-calculus (Q4917199) (← links)
• Lambda calculus with algebraic simplification for reduction parallelisation: Extended study (Q5016210) (← links)
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract) (Q5055747) (← links)
• On the power of simple diagrams (Q5055861) (← links)
• (Q5094148) (← links)
• Termination of combined (rewrite and λ-calculus) systems (Q5881181) (← links)
• Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved (Q5881282) (← links)
• Inductive-data-type systems (Q5958292) (← links)