The following pages link to Functionals defined by recursion (Q2535386):
Displayed 10 items.
- Reduction of higher type levels by means of an ordinal analysis of finite terms (Q759749) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- On a conjecture of Bergstra and Tucker (Q1124321) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840) (← links)
- Ordinal analysis of terms of finite type (Q3887455) (← links)
- An abstract Church-Rosser theorem. II: Applications (Q4041549) (← links)
- A sequent calculus for type assignment (Q4147961) (← links)
- Constructive set theoretic models of typed combinatory logic (Q5287682) (← links)