The following pages link to (Q3322086):
Displaying 12 items.
- Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Parallel beta reduction is not elementary recursive (Q1854460) (← links)
- Herbrand's theorem as higher order recursion (Q1987218) (← links)
- A formal system of reduction paths for parallel reduction (Q1989338) (← links)
- Natural language semantics and computability (Q2425328) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Extracting Herbrand disjunctions by functional interpretation (Q2486989) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- A quantitative model for simply typed λ-calculus (Q5875894) (← links)
