The following pages link to (Q3682463):
Displayed 4 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Introduction to Turing categories (Q998306) (← links)
- Functional programming with combinators (Q1098628) (← links)