Pages that link to "Item:Q5479568"
From MaRDI portal
The following pages link to Computing with Functionals—Computability Theory or Computer Science? (Q5479568):
Displaying 8 items.
- A constructive manifestation of the Kleene-Kreisel continuous functionals (Q290639) (← links)
- Recursive functionals (Q1202200) (← links)
- A class of bounded functions, a database language and an extended lambda calculus (Q2402281) (← links)
- First steps in synthetic computability theory (Q2852343) (← links)
- Limits, higher type computability and type-free languages (Q3708006) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- On the reification of semantic linearity (Q5741580) (← links)
- Another approach to sequentiality: Kleene's unimonotone functions (Q5890056) (← links)