Computing with Functionals—Computability Theory or Computer Science?
From MaRDI portal
Publication:5479568
DOI10.2178/bsl/1140640943zbMath1104.03039OpenAlexW2110195431MaRDI QIDQ5479568
Publication date: 10 July 2006
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1140640943
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of mathematical logic and foundations (03-03) Higher-type and set recursion theory (03D65)
Related Items (4)
A constructive manifestation of the Kleene-Kreisel continuous functionals ⋮ A class of bounded functions, a database language and an extended lambda calculus ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ On the reification of semantic linearity
Cites Work
- Unnamed Item
- Maximal and everywhere-defined functionals
- Computations in higher types
- LCF considered as a programming language
- Fully abstract models of typed \(\lambda\)-calculi
- Unary PCF is decidable
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Computable functionals of finite types
- The sequentially realizable functionals
- On full abstraction for PCF: I, II and III
- Real number computability and domain theory
- An abstract data type for real numbers
- The continuous functionals; computations, recursions and degrees
- Computability over the partial continuous functionals
- An Unsolvable Problem of Elementary Number Theory
- Finitary PCF is not decidable
This page was built for publication: Computing with Functionals—Computability Theory or Computer Science?
