Pages that link to "Item:Q1336046"
From MaRDI portal
The following pages link to Polymorphic rewriting conserves algebraic confluence (Q1336046):
Displaying 15 items.
- On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
- Polymorphic rewriting conserves algebraic strong normalization (Q1176244) (← links)
- Unary PCF is decidable (Q1274980) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
- Polymorphic rewrite rules: confluence, type inference, and instance validation (Q1648875) (← links)
- Normal forms in combinatory logic (Q1903133) (← 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)
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi (Q4632448) (← links)
- Adding algebraic rewriting to the untyped lambda calculus (extended abstract) (Q5055747) (← links)
- On the power of simple diagrams (Q5055861) (← links)
- Confluence of algebraic rewriting systems (Q5879266) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)
- Rewriting with extensional polymorphic \(\lambda \)-calculus (Q6560170) (← links)