Pages that link to "Item:Q1207945"
From MaRDI portal
The following pages link to Adding algebraic rewriting to the untyped lambda calculus (Q1207945):
Displaying 14 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)
- 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)
