Pages that link to "Item:Q2639840"
From MaRDI portal
The following pages link to An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840):
Displaying 15 items.
- A decidable theory of type assignment (Q365669) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case (Q1763159) (← links)
- Exact bounds for acyclic higher-order recursion schemes (Q2112794) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Extracting Herbrand disjunctions by functional interpretation (Q2486989) (← links)
- Exact bounds for lengths of reductions in typed \(\lambda\)-calculus (Q2758058) (← links)
- Elementary Proof of Strong Normalization for Atomic F (Q2957669) (← links)
- Upper bounds for standardizations and an application (Q4254636) (← links)
- (Q4511325) (← links)
- (Q4625705) (← links)
- Typed Lambda Calculi and Applications (Q5704015) (← links)
- Effective longest and infinite reduction paths in untyped λ-calculi (Q5878916) (← links)
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms (Q6635503) (← links)