Pages that link to "Item:Q3708006"
From MaRDI portal
The following pages link to Limits, higher type computability and type-free languages (Q3708006):
Displaying 10 items.
- On existence of limit models over sequences of types (Q278558) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Higher types, finite domains and resource-bounded Turing machines (Q2882561) (← links)
- Ludics with repetitions (Exponentials, Interactive types and Completeness) (Q3003332) (← links)
- Relating type-structures. Partial variations on a theme of Friedman and Statman (Q3026332) (← links)
- Continuous structures and analytic methods in computer science (Q3216107) (← links)
- (Q3708005) (← links)
- (Q3816069) (← links)