Pages that link to "Item:Q4630299"
From MaRDI portal
The following pages link to A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object (Q4630299):
Displaying 10 items.
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060) (← links)
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions (Q1575247) (← links)
- Equality between functionals in the presence of coproducts (Q1854334) (← links)
- An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840) (← links)
- Strongly typed rewriting for coupled software transformation (Q2864515) (← links)
- (Q4036571) (← links)
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi (Q4632448) (← links)
- Some lambda calculi with categorical sums and products (Q5055791) (← links)
- Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract) (Q5055860) (← links)
- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type (Q5055872) (← links)
