The following pages link to (Q3125171):
Displaying 5 items.
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- Finite generation and presentation problems for lambda calculus and combinatory logic (Q2151418) (← links)
- An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840) (← links)
- Probabilistic approach to the lambda definability for fourth order types (Q2851692) (← links)
- Non finitely generated types and λ-terms combinatoric representation cost (Q4522149) (← links)
