Computing with Functionals—Computability Theory or Computer Science?
From MaRDI portal
Recommendations
Cites work
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- An abstract data type for real numbers
- An Unsolvable Problem of Elementary Number Theory
- Computability over the partial continuous functionals
- Computable functionals of finite types
- Computations in higher types
- Finitary PCF is not decidable
- Fully abstract models of typed \(\lambda\)-calculi
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- LCF considered as a programming language
- Maximal and everywhere-defined functionals
- On full abstraction for PCF: I, II and III
- Real number computability and domain theory
- The continuous functionals; computations, recursions and degrees
- The sequentially realizable functionals
- Unary PCF is decidable
Cited in
(13)- Recursive functionals
- A class of bounded functions, a database language and an extended lambda calculus
- First steps in synthetic computability theory
- A constructive manifestation of the Kleene-Kreisel continuous functionals
- Higher-order computability
- scientific article; zbMATH DE number 3933052 (Why is no real title available?)
- scientific article; zbMATH DE number 1163991 (Why is no real title available?)
- Validating Brouwer's continuity principle for numbers using named exceptions
- On the computability of the fan functional
- Conversations with Bill about functionals and terms
- scientific article; zbMATH DE number 2204752 (Why is no real title available?)
- On the reification of semantic linearity
- Another approach to sequentiality: Kleene's unimonotone functions
This page was built for publication: Computing with Functionals—Computability Theory or Computer Science?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479568)
