Pages that link to "Item:Q1207945"

The following pages link to Adding algebraic rewriting to the untyped lambda calculus (Q1207945):

Displaying 21 items.

• The vectorial \(\lambda\)-calculus (Q529049) (← 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)
• A domain model characterising strong normalisation (Q958484) (← links)
• On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
• Confluence of the lambda calculus with left-linear algebraic rewriting (Q1197987) (← links)
• Polymorphic rewriting conserves algebraic confluence (Q1336046) (← links)
• Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
• Abstract data type systems (Q1391729) (← links)
• Normal forms in combinatory logic (Q1903133) (← links)
• Nominal rewriting (Q2373703) (← links)
• A framework for defining logical frameworks (Q2864157) (← links)
• (Q2980972) (← links)
• Linear-algebraic λ-calculus: higher-order, encodings, and confluence. (Q3522006) (← links)
• The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
• On modular properties of higher order extensional lambda calculi (Q4571956) (← links)
• Total unfolding: theory and applications (Q4764611) (← links)
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract) (Q5055747) (← links)
• The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
• Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved (Q5881282) (← links)
• A simplifier for untyped lambda expressions (Q5881291) (← links)